Bus interconnection networks

DOI10.1016/0166-218X(95)00046-TzbMath0852.05066OpenAlexW2064429892MaRDI QIDQ1917343

Fahir Ö. Ergincan, Jean-Claude Bermond

Publication date: 25 November 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00046-t

zbMATH Keywords

hypergraphspoint-to-point networksbus networksprocessorsnetwork diameterbus interconnection networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Hypergraphs (05C65) Applications of graph theory to circuits and networks (94C15)

Related Items

Projective planes and congestion-free networks, Partial line directed hypergraphs, Connectivity and fault-tolerance of hyperdigraphs, EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On finite Moore geometries
• Maximum degree and fractional matchings in uniform hypergraphs
• Large regular graphs with no induced \(2K_ 2\)
• Table of large \(({\Delta{}}, D)\)-graphs
• Directed Moore hypergraphs
• A generalization of Moore graphs of diameter two
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
• On Moore Graphs with Diameters 2 and 3
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Large Graphs with Given Degree and Diameter—Part I
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Processor Interconnection Strategies
• On Moore Geometries, I
• On Moore geometries. II
• MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
• De Bruijn and Kautz bus networks
• GOSSIPING IN BUS INTERCONNECTION NETWORKS
• Dense bipartite digraphs
• Parallel computations on reconfigurable meshes
• The nonexistence of Moore geometries of diameter 4