Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Computer Networks
WG '91 Proceedings of the 17th International Workshop
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs"
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Note: super link-connectivity of iterated line digraphs
Theoretical Computer Science
Sandpile groups and spanning trees of directed line graphs
Journal of Combinatorial Theory Series A
| Hi-index | 14.99 |
A graph has spread (m, k, l) if for any m+1 distinct nodes x, y/sub 1/, . . ., y/sub m/ and m positive integers r/sub 1/, . . ., r/sub m/, such that Sigma /sub i/r/sub i/=k, there exist k node-disjoint paths of length at most 1 from x to the y/sub i/, where r/sub i/ of them end at y/sub i/. This concept contains, and is related to many important concepts used in communications and graph theory. The authors prove an optimal general theorem about the spreads of digraphs generated by line digraph iterations. Useful graphs, like the de Bruijn and Kautz digraphs, can be thus generated. The theorem is applied to the de Bruijn and Kautz digraphs to derive optimal bounds on their spreads, which implies previous results and resolves open questions on their connectivity, diameter, k-diameter, vulnerability, and some other measures related to length-bound disjoint paths.