Competitive self-stabilizing k-clustering
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
Cited in
(9)- A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
- Optimized silent self-stabilizing scheme for tree-based constructions
- Distance domination in graphs
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Self-stabilizing silent disjunction in an anonymous network
- Squeezing streams and composition of self-stabilizing algorithms
- A self-stabilizing k-clustering algorithm for weighted graphs
- Model checking of distributed algorithms using synchronous programs
- Being efficient in time, space, and workload: a self-stabilizing unison and its consequences
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)