Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

DOI10.1137/S0097539798427156MaRDI QIDQ4943757zbMATH OpenOpenAlexFDO

Authors Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, Sriram Pemmaraju

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539798427156

zbMATH Keywords

centerdistributed algorithmmedianself-stabilizationtree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A self-stabilizing distributed algorithm to find the median of a tree graph
• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• A self-stabilizing algorithm for finding weighted centroid in trees
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

Cited in

(27)

• Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
• Stabilizing maximum matching in bipartite networks
• A self-stabilizing distributed algorithm to find the median of a tree graph
• Median problem in some plane triangulations and quadrangulations.
• A self-stabilizing algorithm which finds a 2-center of a tree
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
• Algorithms for path medi-centers of a tree
• Fault-containing self-stabilizing distributed protocols
• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• A self-stabilizing algorithm for finding weighted centroid in trees
• Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
• A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
• The impact of the apex node on routing inside a pyramid structure
• An optimal self-stabilizing strarvation-free alternator
• Weak vs. self vs. probabilistic stabilization
• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• Distributed algorithms for finding centers and medians in networks
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• Argumentation through a distributed self-stabilizing approach
• Randomized self-stabilizing leader election in preference-based anonymous trees
• Upper bounds for sorting permutations with a transposition tree
• Constant space self-stabilizing center finding algorithms in chains and trees
• A self-stabilizing algorithm for the maximum flow problem
• A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems

This page was built for publication: Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

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