Almost Sure Fault Tolerance in Random Graphs

DOI10.1137/0216071zbMath0654.68015OpenAlexW2044458227MaRDI QIDQ3801049

Edward R. 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

random graphdiagnosisPMC modelfault tolerant systemssyndromepermanent faultconnection assignmentself- diagnosable systems

Mathematics Subject Classification ID

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

Related Items (7)

Probabilistic diagnosis of clustered faults for shared structures ⋮ Fast diagnosis of multiprocessor systems with random faults ⋮ Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems ⋮ Fault diagnosis in hypercube multiprocessor systems ⋮ System diagnosis with smallest risk of error ⋮ Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system ⋮ Fault-diagnosis of grid structures.

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