The asymptotic optimality of spider-web networks

DOI10.1016/0166-218X(92)90150-9zbMath0755.94020OpenAlexW1968906205MaRDI QIDQ1199446

Nicholas J. Pippenger

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90150-9

zbMATH Keywords

crossbar networklarge spider-web networkslinking probability

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial probability (60C05) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Unnamed Item ⋮ The blocking probability of spider-web networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation inequalities on some partially ordered sets
• The blocking probability of spider-web networks
• The Connection Patterns of Two Complete Binary Trees
• On Crossbar Switching Networks
• On Blocking Probabilities for Switching Networks

This page was built for publication: The asymptotic optimality of spider-web networks