scholarly journals Self-stabilizing minimum-degree spanning tree within one from the optimal degree

2009 ◽  
Author(s):  
Lelia Blin ◽  
Maria Gradinariu Potop-Butucaru ◽  
Stephane Rovedakis
Keyword(s):  
Spanning Tree ◽  
Minimum Degree ◽  
Optimal Degree

scholarly journals Self-stabilizing minimum degree spanning tree within one from the optimal degree

2011 ◽  
Vol 71 (3) ◽  
pp. 438-449 ◽  
Author(s):  
Lélia Blin ◽  
Maria Gradinariu Potop-Butucaru ◽  
Stephane Rovedakis
Keyword(s):  
Spanning Tree ◽  
Minimum Degree ◽  
Optimal Degree

scholarly journals THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS

2004 ◽  
Vol 15 (03) ◽  
pp. 507-516 ◽  
Author(s):  
LÉLIA BLIN ◽  
FRANCK BUTELLE
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Time Complexity ◽  
Minimum Degree ◽  
Np Hard ◽  
Message Complexity ◽  
General Graphs

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.

Sign in / Sign up

Export Citation Format

Share Document