Competitive self-stabilizing k-clustering

DOI10.1016/J.TCS.2016.02.010MaRDI QIDQ264580zbMATH OpenOpenAlexFDO

Authors Ajoy K. Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre

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

zbMATH Keywords

\(\mathcal{P}\)-completeness\(k\)-clusteringcompetitivenessmaximal independent setMIS treeself-stabilization

Mathematics Subject Classification ID

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)

Recommendations

• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• Robust self-stabilizing weight-based clustering algorithm
• scientific article; zbMATH DE number 2061538

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Packing Inequality for Compact Convex Subsets of the Plane
• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• A self-stabilizing algorithm for constructing breadth-first trees
• A taxonomy of problems with fast parallel algorithms
• An O(n)-time self-stabilizing leader election algorithm
• Self-stabilization
• Self-stabilizing systems in spite of distributed control

Cited in

(7)

• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• Squeezing streams and composition of self-stabilizing algorithms
• Distance domination in graphs
• Optimized silent self-stabilizing scheme for tree-based constructions
• Self-stabilizing silent disjunction in an anonymous network

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)