Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
From MaRDI portal
Publication:4943757
DOI10.1137/S0097539798427156zbMath0937.05071OpenAlexW2006778867MaRDI QIDQ4943757
Steven C. Bruell, Mehmet Hakan Karaata, Sukumar Ghosh, Sriram V. 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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items
A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems, Argumentation through a distributed self-stabilizing approach, Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees, Weak vs. Self vs. Probabilistic Stabilization, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives, Fault-containing self-stabilizing distributed protocols, A self-stabilizing algorithm for finding weighted centroid in trees, Median problem in some plane triangulations and quadrangulations., A self-stabilizing algorithm for the maximum flow problem, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES, Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE, SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS, A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity, Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model, Stabilizing maximum matching in bipartite networks, A self-stabilizing algorithm which finds a 2-center of a tree, The impact of the apex node on routing inside a pyramid structure, An optimal self-stabilizing strarvation-free alternator
