Almost Sure Fault Tolerance in Random Graphs

DOI10.1137/0216071MaRDI QIDQ3801049zbMATH OpenOpenAlexFDO

Authors Edward Scheinerman

Publication date 1987

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

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

zbMATH Keywords

connection assignmentdiagnosisfault tolerant systemspermanent faultPMC modelrandom graphself- diagnosable systemssyndrome

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• System diagnosis with smallest risk of error
• Reliable distributed diagnosis for multiprocessor systems with random faults
• On Fault Isolation and Identification in t₁/t₁-Diagnosable Systems
• Fast diagnosis of multiprocessor systems with random faults
• Reliable Fault Diagnosis with Few Tests

Cited in

(13)

• System diagnosis with smallest risk of error
• Fault-diagnosis of grid structures.
• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems
• Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system
• Probabilistic diagnosis of clustered faults for shared structures
• Fault diagnosis in hypercube multiprocessor systems
• Fast diagnosis of multiprocessor systems with random faults
• scientific article; zbMATH DE number 6945770 (Why is no real title available?)
• scientific article; zbMATH DE number 1361486 (Why is no real title available?)
• False alarms in fault-tolerant dominating sets in graphs
• Distributed corruption detection in networks
• System diagnosis with smallest risk of error
• Probabilistic cluster fault diagnosis for multiprocessor systems

This page was built for publication: Almost Sure Fault Tolerance in Random Graphs

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