A uniform self-stabilizing minimum diameter spanning tree algorithm

DOI10.1007/bfb0022152zbMath1524.68227arXiv1312.3303OpenAlexW1593853426MaRDI QIDQ6084561

Marc Bui, Christian Lavault, Franck Butelle

Publication date: 1 December 2023

Published in: Distributed Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3303

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of spanning tree problems: Part I
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing extensions for message-passing systems
• A distributed algorithm for constructing a minimum diameter spanning tree
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Minimum Diameter Spanning Trees and Related Problems
• Maintenance of a minimum spanning forest in a dynamic plane graph
• Self-stabilizing systems in spite of distributed control
• Time optimal self-stabilizing synchronization
• Resource bounds for self stabilizing message driven protocols
• Self-stabilization by counter flushing

This page was built for publication: A uniform self-stabilizing minimum diameter spanning tree algorithm