An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
From MaRDI portal
Publication:2390286
DOI10.1016/J.IPL.2004.03.010zbMATH Open1178.68384OpenAlexW2006926605MaRDI QIDQ2390286FDOQ2390286
Authors: 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
Recommendations
- An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
- An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
- A self-stabilizing algorithm for maximal matching in anonymous networks
- MIS on trees
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Introduction to Distributed Algorithms
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A self-stabilizing algorithm for maximal matching
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Title not available (Why is that?)
- On generalised minimal domination parameters for paths
Cited In (14)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition
- A self-stabilizing enumeration algorithm.
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- Title not available (Why is that?)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
- Maximum matching for anonymous trees with constant space per process
- Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
- A self-stabilizing 1-maximal independent set algorithm
- Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space
This page was built for publication: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390286)
