Self-stabilizing algorithm for maximal graph partitioning into triangles
B Neggazi, M Haddad, H Kheddouci - … October 1-4, 2012. Proceedings 14, 2012 - Springer
B Neggazi, M Haddad, H Kheddouci
Stabilization, Safety, and Security of Distributed Systems: 14th International …, 2012•SpringerThe 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.
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果