A self-stabilizing algorithm to maximal 2-packing with improved complexity
From MaRDI portal
Publication:436592
DOI10.1016/J.IPL.2012.03.018zbMATH Open1243.68089OpenAlexW2010380569MaRDI QIDQ436592FDOQ436592
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.018
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Introduction to Distributed Algorithms
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- A Best Possible Heuristic for the k-Center Problem
- Relations between packing and covering numbers of a tree
- Title not available (Why is that?)
- Distance-\(k\) knowledge in self-stabilizing algorithms
- 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
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
- Title not available (Why is that?)
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
- Local stabilizer
Cited In (8)
- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- Algorithm to find a maximum 2-packing set in a cactus
- A genetic algorithm for the maximum 2-packing set problem
- The probabilistic approach to limited packings in graphs
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- Title not available (Why is that?)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
- Self-Stabilizing Domination Algorithms
Recommendations
- Title not available (Why is that?) 👍 👎
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler 👍 👎
- An efficient self-stabilizing distance-2 coloring algorithm 👍 👎
- A new self-stabilizing maximal matching algorithm 👍 👎
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets 👍 👎
This page was built for publication: A self-stabilizing algorithm to maximal 2-packing with improved complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436592)
