A self-stabilizing \(k\)-clustering algorithm for weighted graphs
From MaRDI portal
Publication:666253
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
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
Cites Work
This page was built for publication: A self-stabilizing \(k\)-clustering algorithm for weighted graphs