Tight Fault Locality

DOI10.1137/S0097539797319109MaRDI QIDQ4507347zbMATH OpenOpenAlexFDO

Authors Shay Kutten, David Peleg

Publication date 18 October 2000

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

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

zbMATH Keywords

distributed algorithmsfault tolerancerecoverystabilization

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Randomized algorithms (68W20) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Fault-Local Distributed Mending
• Efficient fault-tolerant routings in networks
• Fault-tolerant spanners
• Tolerating linear number of faults in networks of bounded degree
• An Improved Distributed Algorithm for Maximal Independent Set

Cited in

(12)

• Local majorities, coalitions and monopolies in graphs: A review
• Local mending
• Toward more localized local algorithms: removing assumptions concerning global knowledge
• Network decontamination with a single agent
• scientific article; zbMATH DE number 4058841 (Why is no real title available?)
• Fault-Local Distributed Mending
• Fault containment in weakly stabilizing systems
• Distributed error confinement
• Distributed error confinement
• Fast deterministic algorithms for highly-dynamic networks
• Tolerating transient and intermittent failures
• Guaranteed fault containment and local stabilization in routing

This page was built for publication: Tight Fault Locality

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