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

Authors:
L. Blin;F. Butelle
Affiliations:
-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 1

Modeling key agreement in multi-hop ad hoc networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing

Quantified Score

Hi-index	0.00

Visualization

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 achievesO(|V|) time complexity and O(|V| |E|) message complexity.