Neggazi, BrahimBrahimNeggaziTurau, VolkerVolkerTurauHaddad, MohammedMohammedHaddadKheddouci, HamamacheHamamacheKheddouci2019-10-242019-10-242017-06-21Parallel Processing Letters 2 (27): 1750004 (2017)http://hdl.handle.net/11420/3650The 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.en0129-626420172World. Scient. Pressfault-toleranceSelf-stabilizing algorithmstriangle packingtriangle partitiontripartite matchingHandel, Kommunikation, VerkehrJournal Article10.1142/S0129626417500049Other