A self-stabilizing \(k\)-clustering algorithm for weighted graphs

DOI10.1016/j.jpdc.2010.06.009zbMath1233.68045OpenAlexW1966279007MaRDI QIDQ666253

Eddy Caron, Benjamin Depardon, Ajoy K. Datta, Lawrence L. Larmore

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.06.009

zbMATH Keywords

weighted graphself-stabilization\(k\)-clustering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (5)

Competitive self-stabilizing \(k\)-clustering ⋮ A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Squeezing streams and composition of self-stabilizing algorithms ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Fast, silent self-stabilizing distance-\(k\) independent dominating set construction

Uses Software

• GridSolve
• Diet

Cites Work

• An \(O(n)\)-time self-stabilizing leader election algorithm
• Robust self-stabilizing weight-based clustering algorithm
• Self-stabilizing systems in spite of distributed control
• Unnamed Item
• Unnamed Item

This page was built for publication: A self-stabilizing \(k\)-clustering algorithm for weighted graphs