Finding a target subnetwork in sparse networks with random faults

DOI10.1016/0020-0190(93)90172-6MaRDI QIDQ1334631zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Andrzej Pelc, Claire 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) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Sparse networks tolerating random faults.
• Random regular graphs with edge faults: Expansion through cores
• The effect of faults on network expansion
• On the fault tolerance of the butterfly

Cites work

• scientific article; zbMATH DE number 3826957 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 742954 (Why is no real title available?)
• scientific article; zbMATH DE number 3198427 (Why is no real title available?)
• A Graph Model for Fault-Tolerant Computing Systems
• A guided tour of Chernoff bounds
• An optimal 2-FT realization of binary symmetric hierarchical tree systems
• Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance

Cited in

(2)

• Differentially Mutated Subnetworks Discovery
• Sparse networks tolerating random faults.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334631)