A O(m) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs
The triangle partition problem is a generalization of the well-known graph matching problem consisting of finding the maximum number of independent edges in a given graph, i.e., edges with no common node. Triangle partition instead aims to find the maximum number of disjoint triangles. The triangle partition problem is known to be NP-complete. Thus, in this paper, the focus is on the local maximization variant, called maximal triangle partition (MTP). Thus, paper presents a new self-stabilizing algorithm for MTP that converges in O(m) moves under the unfair distributed daemon.
2014 ◽
Vol 2
◽
pp. 377-392
◽
Keyword(s):
2018 ◽
Vol 2018
◽
pp. 1-15
◽
2001 ◽
pp. 361-368
◽
Keyword(s):
1997 ◽
Vol 11
(01)
◽
pp. 169-203
◽
Keyword(s):
2020 ◽
Vol 34
(06)
◽
pp. 10369-10376
2012 ◽
Vol 34
(7)
◽
pp. 1451-1456
◽
Keyword(s):
2012 ◽
Vol 26
(4)
◽
pp. 413-430
◽
Keyword(s):