Finding a target subnetwork in sparse networks with random faults

DOI10.1016/0020-0190(93)90172-6zbMath0813.68058OpenAlexW1982940463MaRDI QIDQ1334631

Pierre Fraigniaud, Andrzej Pelc, Claire M. Kenyon

Publication date: 25 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90172-6

zbMATH Keywords

random graphfault-tolerance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Sparse networks tolerating random faults.

Cites Work

• A guided tour of Chernoff bounds
• Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
• An optimal 2-FT realization of binary symmetric hierarchical tree systems
• A Graph Model for Fault-Tolerant Computing Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding a target subnetwork in sparse networks with random faults