The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs

Abstract : In this paper we present the first distributed algorithm on general graphs for the Minimum Degree Spanning Tree problem. The problem is NP-hard in sequential. Our algorithm give a Spanning Tree of a degree at most 1 from the optimal. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V|) time complexity and O(|V| |E|) message complexity.
Document type :
Journal articles
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00082534
Contributor : Franck Butelle <>
Submitted on : Wednesday, June 28, 2006 - 1:33:28 PM
Last modification on : Thursday, February 7, 2019 - 5:52:46 PM
Long-term archiving on : Monday, April 5, 2010 - 11:30:26 PM

Identifiers

Collections

Citation

Lélia Blin, Franck Butelle. The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. International Journal of Foundations of Computer Science, World Scientific Publishing, 2004, 15, pp.507--516. ⟨10.1142/S0129054104002571⟩. ⟨hal-00082534⟩

Share

Metrics

Record views

470

Files downloads

398