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

DOI10.1080/10637199708915620zbMath0873.68090OpenAlexW1999449286MaRDI QIDQ3130163

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)

Related Items (3)

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks ⋮ SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS

Cites Work

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

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