Self-stabilizing algorithm for maximal graph partitioning into triangles - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Self-stabilizing algorithm for maximal graph partitioning into triangles

Brahim Neggazi
  • Fonction : Auteur
  • PersonId : 980815
Mohammed Haddad

Résumé

The graph partitioning problem consists of dividing a graph into parts or partitions which satisfy some specifications. This problem has several applications such image segmentation, load balancing and communities’ detection. Unfortunately, graph partitioning is known to be NP-complete. In this paper, we present, the first self-stabilizing algorithm for maximal partitioning arbitrary graph into triangles (SPT), then we present the correctness and convergence proofs of the proposed algorithm.
Fichier non déposé

Dates et versions

hal-01353073 , version 1 (10-08-2016)

Identifiants

Citer

Brahim Neggazi, Mohammed Haddad, Hamamache Kheddouci. Self-stabilizing algorithm for maximal graph partitioning into triangles. 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, (SSS'2012) , Oct 2012, The Fields Institute, Toronto, Canada. pp.31-42, ⟨10.1007/978-3-642-33536-5_3⟩. ⟨hal-01353073⟩
137 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More