An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
From MaRDI portal
Publication:2390286
DOI10.1016/j.ipl.2004.03.010zbMath1178.68384OpenAlexW2006926605MaRDI QIDQ2390286
Zhengnan Shi, Stephen T. Hedetniemi, Wayne Goddard
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.010
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs ⋮ Self-stabilizing 2-minimal dominating set algorithms based on loop composition ⋮ A self-stabilizing algorithm to maximal 2-packing with improved complexity ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks ⋮ A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem ⋮ A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph ⋮ A new self-stabilizing maximal matching algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- On generalised minimal domination parameters for paths
- A self-stabilizing algorithm for maximal matching
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Self-stabilizing systems in spite of distributed control
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Introduction to Distributed Algorithms
This page was built for publication: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
