Competitive self-stabilizing k-clustering
DOI10.1016/J.TCS.2016.02.010zbMATH Open1336.68195OpenAlexW2283454896MaRDI QIDQ264580FDOQ264580
Yvan Rivierre, Stéphane Devismes, Karel Heurtefeux, Ajoy K. Datta, Lawrence L. Larmore
Publication date: 31 March 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.010
\(\mathcal{P}\)-completeness\(k\)-clusteringcompetitivenessmaximal independent setMIS treeself-stabilization
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilization
- A taxonomy of problems with fast parallel algorithms
- Self-stabilizing systems in spite of distributed control
- A Packing Inequality for Compact Convex Subsets of the Plane
- An \(O(n)\)-time self-stabilizing leader election algorithm
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs
Cited In (7)
- Distance Domination in Graphs
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
- Squeezing streams and composition of self-stabilizing algorithms
- A Framework for Certified Self-Stabilization
- Optimized silent self-stabilizing scheme for tree-based constructions
- Self-stabilizing silent disjunction in an anonymous network
Recommendations
This page was built for publication: Competitive self-stabilizing \(k\)-clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264580)
