Self-stabilizing minimum degree spanning tree within one from the optimal degree
DOI10.1016/J.JPDC.2010.08.019zbMATH Open1219.68036OpenAlexW2054823807MaRDI QIDQ635330FDOQ635330
Authors: Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis 
Publication date: 19 August 2011
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.08.019
Recommendations
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- scientific article; zbMATH DE number 742978
- scientific article; zbMATH DE number 2006653
- scientific article; zbMATH DE number 1760042
- A self-stabilizing algorithm for constructing spanning trees
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
- Approximating minimum bounded degree spanning trees to within one of optimal
- Degree-bounded minimum spanning trees
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Title not available (Why is that?)
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Title not available (Why is that?)
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Title not available (Why is that?)
Cited In (12)
- Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
- A deterministic worst-case message complexity optimal solution for resource discovery
- New valid inequalities for the optimal communication spanning tree problem
- A maximum degree self-stabilizing spanning tree algorithm
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- Self-stabilizing metric graphs
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Title not available (Why is that?)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
This page was built for publication: Self-stabilizing minimum degree spanning tree within one from the optimal degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635330)
