On the Fault Tolerance of Some Popular Bounded-Degree Networks

DOI10.1137/S0097539793255163zbMath0907.68004OpenAlexW2116777327MaRDI QIDQ4210098

Ramesh K. Sitaraman, Bruce M. Maggs, Frank Thompson Leighton

Publication date: 20 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793255163

zbMATH Keywords

fault tolerancebutterfly networknetwork emulation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Networks with small stretch number ⋮ Cycles in butterfly graphs ⋮ Minimum spanners of butterfly graphs ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Self-spanner graphs

This page was built for publication: On the Fault Tolerance of Some Popular Bounded-Degree Networks