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

2004 ◽  
Author(s):  
L. Blin ◽  
F. Butelle
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Minimum Degree ◽  
General Graphs

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.

Efficient distributed algorithm to solve updating minimum spanning tree problem

1992 ◽  
Vol 23 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Jungho Park ◽  
Ken'Ichi Hagihara ◽  
Nobuki Tokura ◽  
Toshimitsu Masuzawa
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem

scholarly journals Redundancy in distributed proofs

2020 ◽  
Author(s):  
Laurent Feuilloley ◽  
Pierre Fraigniaud ◽  
Juho Hirvonen ◽  
Ami Paz ◽  
Mor Perry
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Remarkable Property ◽  
High Level

Abstract Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.

scholarly journals A Simple Distributed Algorithm for the Maintenance of a Spanning Tree

2007 ◽  
Author(s):  
Brahim Hamid ◽  
Bertrand Le Saëc ◽  
Mohamed Magdy Mosbah
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree
Sign in / Sign up

Export Citation Format

Share Document