{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T02:30:07Z","timestamp":1791340207747,"version":"4.3.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319492582","type":"print"},{"value":"9783319492599","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_17","type":"book-chapter","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T01:11:34Z","timestamp":1478049094000},"page":"195-212","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers"],"prefix":"10.1007","author":[{"given":"Michiko","family":"Inoue","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.7155\/jgaa.00384","volume":"20","author":"Y Asada","year":"2016","unstructured":"Asada, Y., Ooshita, F., Inoue, M.: An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks. J. Graph Algorithms Appl. 20(1), 59\u201378 (2016). http:\/\/dx.doi.org\/10.7155\/jgaa.00384","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Blair, J.R., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 20\u201326. IEEE (2003)","DOI":"10.1109\/ICDCS.2003.1203448"},{"key":"17_CR3","first-page":"151","volume":"153","author":"J Blair","year":"2001","unstructured":"Blair, J., Hedetniemi, S., Hedetniemi, S., Jacobs, D.: Self-stabilizing maximum matchings. Congressus Numerantium 153, 151\u2013160 (2001)","journal-title":"Congressus Numerantium"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 290\u2013297. ACM (2002)","DOI":"10.1145\/571825.571877"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Datta, A.K., Larmoreand, L.L., Masuzawa, T.: Maximum matching for anonymous trees with constant space per process. In: Proceedings of International Conference on Principles of Distributed Systems. pp. 1\u201316 (2015)","DOI":"10.1145\/2684464.2684466"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Devismes, S., Masuzawa, T., Tixeuil, S.: Communication efficiency in self-stabilizing silent protocols. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 474\u2013481. IEEE (2009)","DOI":"10.1109\/ICDCS.2009.24"},{"issue":"11","key":"17_CR7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"17_CR8","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. CoRR abs\/1110.0334 (2011). http:\/\/arxiv.org\/abs\/1110.0334"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-30347-0_13","volume-title":"Fun with Algorithms","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Tixeuil, S., Zhu, N.: The byzantine brides problem. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 107\u2013118. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30347-0_13"},{"key":"17_CR10","unstructured":"Goddard, W., Hedetniemi, S.T., Shi, Z., et al.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 797\u2013803 (2006)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"70","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. 70(4), 406\u2013415 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"17_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-0190(01)00171-5","volume":"80","author":"ST Hedetniemi","year":"2001","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Maximal matching stabilizes in time $$O(m)$$ . Inf. Process. Lett. 80(5), 221\u2013223 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"SC Hsu","year":"1992","unstructured":"Hsu, S.C., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett. 43(2), 77\u201381 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"17_CR14","first-page":"175","volume":"15","author":"MH Karaata","year":"2000","unstructured":"Karaata, M.H., Saleh, K.A.: Distributed self-stabilizing algorithm for finding maximum matching. Comput. Syst. Sci. Eng. 15(3), 175\u2013180 (2000)","journal-title":"Comput. Syst. Sci. Eng."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1587\/transinf.E93.D.2850","volume":"10","author":"M Kimoto","year":"2010","unstructured":"Kimoto, M., Tsuchiya, T., Kikuno, T.: The time complexity of Hsu and Huang\u2019s self-stabilizing maximal matching algorithm. IEICE Trans. Inf. Syst. E93-D 10, 2850\u20132853 (2010)","journal-title":"IEICE Trans. Inf. Syst. E93-D"},{"issue":"14","key":"17_CR16","doi-asserted-by":"crossref","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. 410(14), 1336\u20131345 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"40","key":"17_CR17","doi-asserted-by":"crossref","first-page":"5515","DOI":"10.1016\/j.tcs.2011.05.019","volume":"412","author":"F Manne","year":"2011","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A self-stabilizing 2\/3-approximation algorithm for the maximum matching problem. Theor. Comput. Sci. 412(40), 5515\u20135526 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to distributed algorithms. Cambridge University Press, New York (2000)"}],"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-319-49259-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T23:12:45Z","timestamp":1749683565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}