THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
From MaRDI portal
Publication:3022016
DOI10.1142/S0129054104002571zbMATH Open1067.68790OpenAlexW1540674943MaRDI QIDQ3022016FDOQ3022016
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002571
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
Cited In (5)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees
- Maximum metric spanning tree made Byzantine tolerant
- Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
Recommendations
This page was built for publication: THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022016)
