A self-stabilizing k-clustering algorithm for weighted graphs

DOI10.1016/J.JPDC.2010.06.009MaRDI QIDQ666253zbMATH OpenOpenAlexFDO

Authors Eddy Caron, Ajoy K. Datta, Benjamin Depardon, 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

\(k\)-clusteringself-stabilizationweighted graph

Mathematics Subject Classification ID

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

Recommendations

• Robust self-stabilizing weight-based clustering algorithm
• Competitive self-stabilizing \(k\)-clustering
• A weight-based clustering algorithm for mobile ad hoc network
• A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
• Self-stabilizing metric graphs

Cites work

• An O(n)-time self-stabilizing leader election algorithm
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Robust self-stabilizing weight-based clustering algorithm
• Self-stabilization
• Self-stabilizing systems in spite of distributed control

Cited in

(7)

• Robust self-stabilizing weight-based clustering algorithm
• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
• A graph clustering algorithm based on a clustering coefficient for weighted graphs
• Competitive self-stabilizing \(k\)-clustering
• Self-stabilizing silent disjunction in an anonymous network
• Squeezing streams and composition of self-stabilizing algorithms

Describes a project that uses

Uses Software

• Diet
• GridSolve

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666253)