A self-stabilizing algorithm for maximal p-star decomposition of general graphs

Abstract

A p-star is a complete bipartite graph K1,p with one center node and p leaf nodes. In this paper we propose the first distributed self-stabilizing algorithm for graph decomposition into p-stars. For a graph G and an integer p ≥ 1, this decomposition provides disjoint components of G where each component forms a p-star. We prove convergence and correctness of the algorithm under an unfair distributed daemon. The stabilization time is 2[n/p+1] + 2 rounds. © Springer International Publishing 2013.