{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:54:52Z","timestamp":1761976492999,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030883"},{"type":"electronic","value":"9783319030890"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03089-0_6","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"74-85","source":"Crossref","is-referenced-by-count":2,"title":["A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs"],"prefix":"10.1007","author":[{"given":"Brahim","family":"Neggazi","sequence":"first","affiliation":[]},{"given":"Volker","family":"Turau","sequence":"additional","affiliation":[]},{"given":"Mohammed","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. In: Proceedings 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, pp. 120\u2013124 (2004)","DOI":"10.1145\/1007912.1007931"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bein, D., Datta, A.K., Jagganagari, C.H., 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":"6_CR3","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.: Self-stabilizing deterministic network decomposition. J. Parallel Distrib. Comput.\u00a062(4), 696\u2013714 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1504\/IJGUC.2009.022031","volume":"1","author":"A. Bendjoudi","year":"2009","unstructured":"Bendjoudi, A., Melab, N., Talbi, E.-G.: P2p design and implementation of a parallel branch and bound algorithm for grids. Int. J. Grid Util. Comput.\u00a01(2), 159\u2013168 (2009)","journal-title":"Int. J. Grid Util. Comput."},{"key":"6_CR5","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)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/1097-0118(200102)36:2<59::AID-JGT1>3.0.CO;2-A","volume":"36","author":"D. Bryant","year":"2001","unstructured":"Bryant, D., El-Zanati, S., Eynden, C.H.: Star factorizations of graph products. J. Graph. Theory\u00a036(2), 59\u201366 (2001)","journal-title":"J. Graph. Theory"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/S0004972700040582","volume":"10","author":"P. Cain","year":"1974","unstructured":"Cain, P.: Decomposition of complete graphs into stars. Bull. Austral. Math. Soc.\u00a010, 23\u201330 (1974)","journal-title":"Bull. Austral. Math. Soc."},{"key":"6_CR8","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":"6_CR9","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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-stabilization. MIT Press (2000)","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"6_CR11","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. CoRR, abs\/1110.0334 (2011)"},{"issue":"6","key":"6_CR12","first-page":"251","volume":"7","author":"N. Gnanadhas","year":"2012","unstructured":"Gnanadhas, N., Ebin Raja Merly, E.: Linear star decomposition of lobster. Int. J. of Contemp. Math. Sciences\u00a07(6), 251\u2013261 (2012)","journal-title":"Int. J. of Contemp. Math. Sciences"},{"key":"6_CR13","unstructured":"Goddard, W., Hedetniemi, S., Jacobs, D., Srimani, K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IPDPS, p. 162.2 (2003)"},{"key":"6_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.jpdc.2009.11.006"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11945529_29","volume-title":"Principles of Distributed Systems","author":"C. Johnen","year":"2006","unstructured":"Johnen, C., Nguyen, L.H.: Robust self-stabilizing clustering algorithm. In: Shvartsman, A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 410\u2013424. Springer, Heidelberg (2006)"},{"key":"6_CR16","first-page":"240","volume-title":"STOC","author":"D. Kirkpatrick","year":"1978","unstructured":"Kirkpatrick, D., Hell, P.: On the completeness of a generalized matching problem. In: STOC, pp. 240\u2013245. ACM, New York (1978)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D., Hell, P.: On the complexity of general graph factor problems. SIAM Journal on Computing\u00a012(3), 601\u2013609 (1983)","journal-title":"SIAM Journal on Computing"},{"issue":"2-3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.disc.2005.04.023","volume":"301","author":"H. Lee","year":"2005","unstructured":"Lee, H., Lin, C.H.: Balanced star decompositions of regular multigraphs and \u03bb-fold complete bipartite graphs. Discrete Mathematics\u00a0301(2-3), 195\u2013206 (2005)","journal-title":"Discrete Mathematics"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Lemmouchi, S., Haddad, M., Kheddouci, H.: Study of robustness of community emerged from exchanges in networks communication. In: Proceedings 11th International ACM Conference on Management of Emergent Digital EcoSystems, MEDES, pp. 189\u2013196 (2011)","DOI":"10.1145\/2077489.2077525"},{"issue":"1011","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.comcom.2013.03.006","volume":"36","author":"S. Lemmouchi","year":"2013","unstructured":"Lemmouchi, S., Haddad, M., Kheddouci, H.: Robustness study of emerged communities from exchanges in peer-to-peer networks. Computer Communications\u00a036(1011), 1145\u20131158 (2013)","journal-title":"Computer Communications"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<361::AID-JGT5>3.0.CO;2-P","volume":"23","author":"C. Lin","year":"1996","unstructured":"Lin, C., Shyu, T.: A necessary and sufficient condition for the star decomposition of complete graphs. J. Graph Theory\u00a023(4), 361\u2013364 (1996)","journal-title":"J. Graph Theory"},{"issue":"14","key":"6_CR22","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":"6_CR23","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Melab, N., Talbi, E.-G.: A Grid-based Parallel Approach of the Multi-Objective Branch and Bound. In: Proceedings 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP, pp. 23\u201330 (2007)","DOI":"10.1109\/PDP.2007.7"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-33536-5_3","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"B. Neggazi","year":"2012","unstructured":"Neggazi, B., Haddad, M., Kheddouci, H.: Self-stabilizing algorithm for maximal graph partitioning into triangles. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol.\u00a07596, pp. 31\u201342. Springer, Heidelberg (2012)"},{"key":"6_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"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03089-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:25:54Z","timestamp":1746033954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}