The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs

Author

Blin, L. ; Butelle, F.

Author_Institution

CNRS, Univ. de Paris-Nord, Villetaneuse, France

fYear

2003

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 gives 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.

Keywords

computational complexity; distributed algorithms; minimisation; tree data structures; NP-hard problem; approximated distributed algorithm; asynchronous algorithm; asynchronous arbitrary networks; general graphs; message complexity; minimum degree spanning tree problem; time complexity; Broadcasting; Distributed algorithms; Distributed processing; Polynomials; Protocols; System recovery; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

ISSN

1530-2075

Print_ISBN

0-7695-1926-1

Type

conf

DOI

10.1109/IPDPS.2003.1213299

Filename

1213299

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1664356