{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:54Z","timestamp":1725520674363},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893349"},{"type":"electronic","value":"9783540893356"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89335-6_10","type":"book-chapter","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T09:31:45Z","timestamp":1226395905000},"page":"94-108","source":"Crossref","is-referenced-by-count":2,"title":["A Self-stabilizing $\\frac{2}{3}$ -Approximation Algorithm for the Maximum Matching Problem"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Manne","sequence":"first","affiliation":[]},{"given":"Morten","family":"Mjelde","sequence":"additional","affiliation":[]},{"given":"Laurence","family":"Pilard","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/ICDCS.2003.1203448","volume-title":"ICDCS 2003: Proceedings of the 23rd International Conference on Distributed Computing Systems","author":"J.R.S. Blair","year":"2003","unstructured":"Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: ICDCS 2003: Proceedings of the 23rd International Conference on Distributed Computing Systems, Washington, DC, USA, pp. 20\u201326. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-49823-0_15","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"P. Danturi","year":"2006","unstructured":"Danturi, P., Nesterenko, M., Tixeuil, S.: Self-stabilizing philosophers with generic conflicts. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 214\u2013230. Springer, Heidelberg (2006)"},{"issue":"11","key":"10_CR3","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":"10_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"10_CR5","unstructured":"Ghosh, S., Gupta, A., Karaata, M.H., Pemmaraju, S.V.: Self-stabilizing dynamic programming algorithms on trees. In: Proceedings of the Second Workshop on Self-Stabilizing Systems (WSSS 1995), Las Vegas, pp. 11.1\u201311.15 (1995)"},{"key":"10_CR6","first-page":"162","volume-title":"IPDPS\u201903: Proceedings of the 17th International Symposium on Parallel and Distributed Processing","author":"W. Goddard","year":"2003","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 2003: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, Washington, DC, USA, p. 162.2. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"1-2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2008.02.009","volume":"399","author":"W. Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Trevisan, V.: Distance-k knowledge in self-stabilizing algorithms. Theor. Comput. Sci.\u00a0399(1-2), 118\u2013127 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","unstructured":"Goddard, W., Hedetniemi, S.T., Shi, Z.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: PDPTA 2006: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, vol.\u00a0\u00a02, pp. 797\u2013803. CSREA Press (2006)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44681-8_67","volume-title":"Euro-Par 2001 Parallel Processing","author":"M. Gradinariu","year":"2001","unstructured":"Gradinariu, M., Johnen, C.: Self-stabilizing neighborhood unique naming under unfair scheduler. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001, vol.\u00a02150, pp. 458\u2013465. Springer, Heidelberg (2001)"},{"key":"10_CR10","volume-title":"ICDCS 2007: Proceedings of the International Conference on Distributed Computing Systems","author":"M. Gradinariu","year":"2007","unstructured":"Gradinariu, M., Tixeuil, S.: Conflict managers for self-stabilization without fairness assumption. In: ICDCS 2007: Proceedings of the International Conference on Distributed Computing Systems. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"5","key":"10_CR11","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":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR13","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":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-72951-8_9","volume-title":"Structural Information and Communication Complexity","author":"F. Manne","year":"2007","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 96\u2013108. Springer, Heidelberg (2007)"},{"issue":"6","key":"10_CR15","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-540-89335-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T20:11:30Z","timestamp":1551643890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89335-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893349","9783540893356"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89335-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}