A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

DOI10.1080/10637199708915620MaRDI QIDQ3130163zbMATH OpenOpenAlexFDO

Authors Gheorghe Antonoiu, Pradip K. Srimani

Publication date 28 May 1997

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199708915620

zbMATH Keywords

self-stabilizing algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• A self-stabilizing distributed algorithm to find the median of a tree graph
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• A self-stabilizing algorithm for finding weighted centroid in trees
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• A self-stabilizing algorithm which finds a 2-center of a tree
• An efficient distributed algorithm for centering a spanning tree of a biconnected graph
• Distributed Algorithms for Finding Central Paths in Tree Networks
• Constant space self-stabilizing center finding algorithms in chains and trees
• A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph

Cites work

• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Self-stabilizing depth-first search
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing systems in spite of distributed control
• Stabilizing unison
• Unifying self-stabilization and fault-tolerance

Cited in

(14)

• A linear algorithm for finding the k‐broadcast center of a tree
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Constant space self-stabilizing center finding algorithms in chains and trees
• A self-stabilizing algorithm which finds a 2-center of a tree
• A self-stabilizing distributed algorithm to find the median of a tree graph
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• A self-stabilizing algorithm for finding weighted centroid in trees
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
• An efficient distributed algorithm for centering a spanning tree of a biconnected graph

This page was built for publication: A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130163)