A self-stabilizing \(k\)-clustering algorithm for weighted graphs (Q666253): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An \(O(n)\)-time self-stabilizing leader election algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-stabilizing systems in spite of distributed control / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2782251 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust self-stabilizing weight-based clustering algorithm / rank | |||
Normal rank |
Revision as of 00:03, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A self-stabilizing \(k\)-clustering algorithm for weighted graphs |
scientific article |
Statements
A self-stabilizing \(k\)-clustering algorithm for weighted graphs (English)
0 references
7 March 2012
0 references
\(k\)-clustering
0 references
self-stabilization
0 references
weighted graph
0 references