Optimal fault-tolerant distributed construction of a spanning forest

DOI10.1016/0020-0190(88)90217-7MaRDI QIDQ1105570zbMATH OpenOpenAlexFDO

Authors 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

distributed algorithmfault toleranceasynchronous networkspanning tree

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• New bounds for the controller problem

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

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