A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs

Brahim Neggazi
  • Function : Author
  • PersonId : 980815
Volker Turau
  • Function : Author
Mohammed Haddad

Abstract

A p-star is a complete bipartite graph K 1,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.

Dates and versions

hal-01339275 , version 1 (29-06-2016)

Identifiers

Cite

Brahim Neggazi, Volker Turau, Mohammed Haddad, Hamamache Kheddouci. A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs. Stabilization, Safety, and Security of Distributed Systems, Nov 2013, Osaka, Japan. pp.74-85, ⟨10.1007/978-3-319-03089-0_6⟩. ⟨hal-01339275⟩
102 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More