scientific article; zbMATH DE number 1334210

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199907)33:4<249::AID-NET2>3.0.CO;2-7" /><249::AID-NET2>3.0.CO;2-7 10.1002/(SICI)1097-0037(199907)33:4<249::AID-NET2>3.0.CO;2-7zbMath0949.05078MaRDI QIDQ4262014

Nicholas J. Pippenger

Publication date: 27 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pathcutchannel graphinterconnection networkfailure probabilityparallel graphlinking probabilityspider-web graphvacancy probability

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Search theory (90B40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Analytic circuit theory (94C05) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Local versus global search in channel graphs

Cites Work

• The asymptotic optimality of spider-web networks
• The blocking probability of spider-web networks
• Rearrangeable Networks with Limited Depth
• The Connection Patterns of Two Complete Binary Trees
• Proving the Rearrangeability of Connecting Networks by Group Calculations
• On Crossbar Switching Networks
• Optimal Rearrangeable Multistage Connecting Networks
• Routing algorithms for switching networks with probabilistic traffic

This page was built for publication: