Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

Authors:
Steven C. Bruell;Sukumar Ghosh;Mehmet Hakan Karaata;Sriram V. Pemmaraju
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 15

Self-Stabilizing Strong Fairness under Weak Fairness

IEEE Transactions on Parallel and Distributed Systems
A stabilizing algorithm for finding biconnected components

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Efficient Self-stabilizing Algorithms for Tree Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Median problem in some plane triangulations and quadrangulations

Computational Geometry: Theory and Applications
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

Journal of Computer and System Sciences
Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems

Artificial Intelligence
An optimal self-stabilizing strarvation-free alternator

Journal of Computer and System Sciences
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems

Information Processing Letters
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model

Discrete Applied Mathematics
Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems

Artificial Intelligence
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

Computers & Mathematics with Applications
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
Composition of fault-containing protocols based on recovery waiting fault-containing composition framework

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
An application of snap-stabilization: matching in bipartite graphs

ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Locating a center or a median in a graph is a fundamental graph-theoretic problem. Centers and medians are especially important in distributed systems because they are ideal locations for placing resources that need to be shared among different processes in a network. This paper presents simple self-stabilizing algorithms for locating centers and medians of trees. Since these algorithms are self-stabilizing, they can tolerate transient failures. In addition, they can automatically adjust to a dynamically changing tree topology. After the algorithms are presented, their correctness is proven and upper bounds on their time complexity are established. Finally, extensions of our algorithms to trees with arbitrary, positive edge costs are sketched.