A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
We address the decomposition of graphs into stars in a distributed way. We propose a new self-stabilizing algorithm for decomposing arbitrary graphs into stars having same size. The proposed algorithm has polynomial moves complexity. Formal proofs for correctness and convergence are provided.
self-stabilization graph decomposition uniform stars generalized matching graph algorithms fault tolerence distributed systems