Communication aspects of networks based on geometric incidence relations

DOI10.1016/0304-3975(89)90099-6zbMath0669.94025MaRDI QIDQ1119610

Eli Shamir, Assaf Schuster

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90099-6

zbMATH Keywords

complexity; networks; projective space; redundancy; incidence relation; parallel-routing algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

94C15: Applications of graph theory to circuits and networks

51E99: Finite geometry and special incidence structures

Related Items

Application of coding theory to interconnection networks

Cites Work

• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• The Gamma Network
• Large Graphs with Given Degree and Diameter—Part I
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• A Regular Fault-Tolerant Architecture for Interconnection Networks
• Efficient Schemes for Parallel Communication
• A group-theoretic model for symmetric interconnection networks
• Optimal clustering structures for hierarchical topological design of large computer networks
• Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
• Design to Minimize Diameter on Building-Block Network
• The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems
• A Scheme for Fast Parallel Communication
• A Fault-Tolerant Communication Architecture for Distributed Systems
• A universal interconnection pattern for parallel computers