Abstract
The graph partitioning problem consists of dividing a graph into parts, patterns or partitions which satisfy some specifications. Graph partitioning problems are known to be NP-complete. In this paper, we focus on the particular pattern of triangles and present the first Self-stabilizing algorithm for Maximal Partitioning of arbitrary graphs into Triangles (MPT). Then, we give the correctness and convergence proofs of the proposed algorithm. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Neggazi, B., Haddad, M., & Kheddouci, H. (2012). Self-stabilizing algorithm for maximal graph partitioning into triangles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7596 LNCS, pp. 31–42). https://doi.org/10.1007/978-3-642-33536-5_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
