A fully distributed (minimal) spanning tree algorithm

DOI10.1016/0020-0190(86)90043-8zbMath0611.05015OpenAlexW2087528263MaRDI QIDQ1087548

G. Roucairol, Ivan Lavallée

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90043-8

zbMATH Keywords

communicationcooperationminimum spanning treeconcurrencyprocessesdistributed networkasynchronous distributed algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

On the impact of sense of direction on message complexity ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION ⋮ The Steiner problem in distributed computing systems ⋮ Sense of direction in distributed computing

Cites Work

• Unnamed Item
• A parallel algorithm for constructing minimum spanning trees
• Distributed Termination
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Reverse path forwarding of broadcast packets

This page was built for publication: A fully distributed (minimal) spanning tree algorithm