Distance-\(k\) knowledge in self-stabilizing algorithms
From MaRDI portal
Publication:930908
DOI10.1016/j.tcs.2008.02.009zbMath1146.68057OpenAlexW2081472988MaRDI QIDQ930908
Stephen T. Hedetniemi, Wayne Goddard, Vilmar Trevisan, David P. Jacobs
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.009
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (16)
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem ⋮ Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ A fast approximation algorithm for the maximum 2-packing set problem on planar graphs ⋮ Efficient transformation of distance-2 self-stabilizing algorithms ⋮ A self-stabilizing algorithm to maximal 2-packing with improved complexity ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ A self-stabilizing algorithm for optimally efficient sets in graphs ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ Algorithm to find a maximum 2-packing set in a cactus ⋮ SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS ⋮ A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon ⋮ A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem ⋮ A self-stabilizing algorithm for constructing weakly connected minimal dominating sets ⋮ Self-Stabilizing Domination Algorithms
Cites Work
This page was built for publication: Distance-\(k\) knowledge in self-stabilizing algorithms
