De Bruijn and Kautz bus networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P" /><205::AID-NET5>3.0.CO;2-P 10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-PzbMath0893.90059OpenAlexW1990068115MaRDI 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

zbMATH Keywords

bus interconnection networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (7)

Partial line directed hypergraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ Directed Moore hypergraphs ⋮ Bus interconnection networks ⋮ 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

This page was built for publication: De Bruijn and Kautz bus networks