Optimal fault-tolerant distributed construction of a spanning forest

DOI10.1016/0020-0190(88)90217-7zbMath0648.94026OpenAlexW2039269991MaRDI QIDQ1105570

Shay Kutten

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90217-7

zbMATH Keywords

fault tolerancespanning treedistributed algorithmasynchronous network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

New bounds for the controller problem

Cites Work

• Impossibility of distributed consensus with one faulty process
• Fault tolerant distributed majority commitment
• The Byzantine Generals Problem
• A Distributed Algorithm for Minimum-Weight Spanning Trees

This page was built for publication: Optimal fault-tolerant distributed construction of a spanning forest