{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:59:59Z","timestamp":1765040399259,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335358"},{"type":"electronic","value":"9783642335365"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33536-5_3","type":"book-chapter","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T11:52:35Z","timestamp":1349005955000},"page":"31-42","source":"Crossref","is-referenced-by-count":4,"title":["Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles"],"prefix":"10.1007","author":[{"given":"Brahim","family":"Neggazi","sequence":"first","affiliation":[]},{"given":"Mohammed","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-24550-3_33","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F.M. Al-Azemi","year":"2011","unstructured":"Al-Azemi, F.M., Karaata, M.H.: Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol.\u00a06976, pp. 433\u2013434. Springer, Heidelberg (2011)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, pp. 120\u2013124 (2004)","DOI":"10.1145\/1007912.1007931"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 223\u2013237. Springer, Heidelberg (2000)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In: ISPAN, pp. 436\u2013441 (2005)","DOI":"10.1109\/ISPAN.2005.12"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1006\/jpdc.2001.1811","volume":"62","author":"F. Belkouch","year":"2002","unstructured":"Belkouch, F., Bui, M., Chen, L., Datta, A.K.: Self-stabilizing deterministic network decomposition. J. Parallel Distrib. Comput.\u00a062(4), 696\u2013714 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-16023-3_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L. Blin","year":"2010","unstructured":"Blin, L., Potop-Butucaru, M.G., Rovedakis, S., Tixeuil, S.: Loop-Free Super-Stabilizing Spanning Tree Construction. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 50\u201364. Springer, Heidelberg (2010)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-642-03869-3_57","volume-title":"Euro-Par 2009 Parallel Processing","author":"E. Caron","year":"2009","unstructured":"Caron, E., Datta, A.K., Depardon, B., Larmore, L.L.: A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol.\u00a05704, pp. 602\u2013614. Springer, Heidelberg (2009)"},{"issue":"11","key":"3_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-stabilization. MIT Press (2000)","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"3_CR10","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. CoRR, abs\/1110.0334 (2011)"},{"key":"3_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-77444-0_16","volume-title":"Distributed Computing and Networking","author":"W. Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 182\u2013190. Springer, Heidelberg (2008)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: A robust distributed generalized matching protocol that stabilizes in linear time. In: ICDCS Workshops, pp. 461\u2013465 (2003)","DOI":"10.1109\/ICDCSW.2003.1203595"},{"key":"3_CR14","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: IPDPS, p. 162 (2003)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Gradinariu, M., Tixeuil, S.: Conflict managers for self-stabilization without fairness assumption. In: Proceedings of the 27th International Conference on Distributed Computing Systems, ICDCS 2007, Washington, DC, USA, p. 46 (2007)","DOI":"10.1109\/ICDCS.2007.95"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"4","author":"N. Guellati","year":"2010","unstructured":"Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput.\u00a0(4), 406\u2013415 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"3_CR17","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1016\/j.comcom.2008.12.035","volume":"32","author":"R. Hadid","year":"2009","unstructured":"Hadid, R., Karaata, M.H.: An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Computer Communications\u00a032(5), 858\u2013866 (2009)","journal-title":"Computer Communications"},{"issue":"1-2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00607-009-0025-z","volume":"84","author":"R. Hadid","year":"2009","unstructured":"Hadid, R., Karaata, M.H.: Stabilizing maximum matching in bipartite networks. Computing\u00a084(1-2), 121\u2013138 (2009)","journal-title":"Computing"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.jcss.2005.05.001","volume":"71","author":"M.H. Karaata","year":"2005","unstructured":"Karaata, M.H.: An optimal self-stabilizing strarvation-free alternator. J. Comput. Syst. Sci.\u00a071(4), 480\u2013494 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(01)00171-5","volume":"80","author":"S.T. Hedetniemi","year":"2001","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Maximal matching stabilizes in time o(m). Inf. Process. Lett.\u00a080(5), 221\u2013223 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.-C. Hsu","year":"1992","unstructured":"Hsu, S.-C., Huang, S.-T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett.\u00a043(2), 77\u201381 (1992)","journal-title":"Inf. Process. Lett."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Ishii, H., Kakugawa, H.: A self-stabilizing algorithm for finding cliques in distributed systems. In: IEEE Symposium on Reliable Distributed Systems, vol.\u00a00, p. 390 (2002)","DOI":"10.1109\/RELDIS.2002.1180216"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-642-05118-0_62","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M.H. Karaata","year":"2009","unstructured":"Karaata, M.H., Hadid, R.: Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 789\u2013790. Springer, Heidelberg (2009)"},{"issue":"14","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1016\/j.tcs.2008.12.022","volume":"410","author":"F. Manne","year":"2009","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. Theor. Comput. Sci.\u00a0410(14), 1336\u20131345 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Pothen, A.: Graph partitioning algorithms with applications to scientific computing. Technical report, Norfolk, VA, USA (1997)","DOI":"10.1007\/978-94-011-5412-3_12"},{"issue":"5","key":"3_CR26","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.comcom.2010.05.006","volume":"34","author":"B. Serrour","year":"2011","unstructured":"Serrour, B., Arenas, A., Gomez, S.: Detecting communities of triangles in complex networks using spectral optimization. Computer Communications\u00a034(5), 629\u2013634 (2011)","journal-title":"Computer Communications"},{"issue":"6","key":"3_CR27","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(94)90098-1","volume":"49","author":"G. Tel","year":"1994","unstructured":"Tel, G.: Maximal matching stabilizes in quadratic time. Inf. Process. Lett.\u00a049(6), 271\u2013272 (1994)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33536-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T19:31:52Z","timestamp":1744227112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33536-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335358","9783642335365"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33536-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}