De Bruijn and Kautz bus networks
From MaRDI portal
Publication:4363413
DOI<205::AID-NET5>3.0.CO;2-P 10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-PzbMath0893.90059MaRDI QIDQ4363413
Fahir Ö. Ergincan, Robin W. Dawes, Jean-Claude Bermond
Publication date: 6 November 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199710)30:3<205::aid-net5>3.0.co;2-p
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
68M07: Mathematical problems of computer architecture
Related Items
Partial line directed hypergraphs, EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS, de Bruijn sequences and de Bruijn graphs for a general language, Minimum Eulerian circuits and minimum de Bruijn sequences, Connectivity and fault-tolerance of hyperdigraphs, Directed Moore hypergraphs, Bus interconnection networks