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

Lélia Blin (1) , Franck Butelle (2)

1 LaMI - Laboratoire de Méthodes Informatiques
2 LIPN - Laboratoire d'Informatique de Paris-Nord

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.

Mots clés: Systèmes distribués et parallèles; Informatique théorique; algorithmique

Domaines: Informatique

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, 2004, 15, pp.507--516. ⟨10.1142/S0129054104002571⟩. ⟨hal-00082534⟩