A Self-Stabilizing Minimal k-Grouping Algorithm


We consider the minimal k-grouping problem: given a graph G = (V, E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent self-stabilizing asynchronous distributed algorithm for this problem in the composite atomicity model of computation, assuming… (More)
DOI: 10.1145/3007748.3007772

5 Figures and Tables


  • Presentations referencing similar topics