Neggazi, BrahimBrahimNeggaziTurau, VolkerVolkerTurauHaddad, MohammedMohammedHaddadKheddouci, HamamacheHamamacheKheddouci2020-04-292020-04-292013Stabilization, safety, and security of distributed systems : 15th international symposium, SSS 2013, Osaka, Japan, November 13 - 16, 2013 ; proceedings / Teruo Higashino... (eds.). - Cham : Springer, 2013. - (8255 LNCS). - Seite 74-85http://hdl.handle.net/11420/5983A 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.enGeneralized matchingGraph decompositionMaster-slave modelSelf-stabilizing algorithmStarsInformatikConference Paper10.1007/978-3-319-03089-0_6Conference Paper