Finding Euler tours in parallel
Journal of Computer and System Sciences
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Embedding meshes of trees into deBruijn graphs
Information Processing Letters
A VLSI decomposition of the deBruijn graph
Journal of the ACM (JACM)
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
MPPOI '95 Proceedings of the Second Workshop on Massively Parallel Processing Using Optical Interconnections
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Fault-tolerant cycle embedding in dual-cube with node faults
International Journal of High Performance Computing and Networking
| Hi-index | 14.98 |
We present a distributed network-level algorithm that constructs a cycle in a d-ary De Bruijn multiprocessor network in the presence of an arbitrary number of node failures. When the number of faults f does not exceed d驴 1 a cycle of length at least dn驴nf驴 1 can always be found in O(n) steps in a network of size dn.