Sparse networks tolerating random faults.

DOI10.1016/S0166-218X(03)00263-4zbMath1066.68008OpenAlexW2031020240MaRDI QIDQ1427202

D. Massart

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00263-4

zbMATH Keywords

Cayley graphde Bruijn networkFault-tolerant networkPartial \(k\)-treeShuffle-exchange network

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• A guided tour of Chernoff bounds
• Expanding graphs contain all small trees
• Explicit construction of linear sized tolerant networks
• Finding a target subnetwork in sparse networks with random faults
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Sparse networks tolerating random faults.