Wide-Sense Nonblocking Networks
From MaRDI portal
Publication:3794088
DOI10.1137/0401018zbMath0648.94025OpenAlexW2010387743MaRDI QIDQ3794088
Paul Feldman, Joel Friedman, Nicholas J. Pippenger
Publication date: 1988
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/116
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items
On the diameter and bisector size of Cayley graphs ⋮ Parallel algorithms for routing in nonblocking networks ⋮ Construction of asymmetric connectors of depth two ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Tree embeddings ⋮ Hypercube sandwich approach to conferencing. ⋮ Nonblocking self-routing switching networks ⋮ Interactive Communication, Diagnosis and Error Control in Networks
