High density graphs for processor interconnection

DOI10.1016/0020-0190(81)90107-1zbMath0463.68004OpenAlexW2021838712MaRDI QIDQ1153674

Leonard Uhr, Marvin Solomon, Li Qiao, Raphael Ari Finkel, Will E. Leland

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90107-1

zbMATH Keywords

computer networkmulticomputerinterconnection graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Related Items

Tables of large graphs with given degree and diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On the impossibility of certain Moore graphs
• On Moore Graphs with Diameters 2 and 3
• Design to Minimize Diameter on Building-Block Network
• The Indirect Binary n-Cube Microprocessor Array
• The Design of Small-Diameter Networks by Local Search
• A Design for (d, k) Graphs
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• On the Equivalence of Finite-State Sequential Machine Models
• Improved Construction Techniques for (d, k) Graphs