{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:15:12Z","timestamp":1767183312044},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129626417500049","type":"journal-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T04:11:32Z","timestamp":1497931892000},"page":"1750004","source":"Crossref","is-referenced-by-count":1,"title":["A <i>O<\/i>(<i>m<\/i>) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs"],"prefix":"10.1142","volume":"27","author":[{"given":"Brahim","family":"Neggazi","sequence":"first","affiliation":[{"name":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"}]},{"given":"Volker","family":"Turau","sequence":"additional","affiliation":[{"name":"Hamburg University of Technology, Institute of Telematics, Am Schwarzenberg-Campus 3, 21073 Hamburg, Germany"}]},{"given":"Mohammed","family":"Haddad","sequence":"additional","affiliation":[{"name":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[{"name":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"}]}],"member":"219","published-online":{"date-parts":[[2017,6,20]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1811"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00274-0"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.010"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.874839"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.05.002"},{"key":"p_14","volume":"406","author":"Guellati Nabil","year":"2010","journal-title":"J. Parallel Distrib. Comput., (4)"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626413500011"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00171-5"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.09.004"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2013.03.006"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.022"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.07.026"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.05.006"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.009"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90098-1"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.02.013"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.12.008"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626417500049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:22:20Z","timestamp":1565083340000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626417500049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,6,20]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S0129626417500049"],"URL":"https:\/\/doi.org\/10.1142\/s0129626417500049","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}