{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:41:18Z","timestamp":1769157678970,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540766261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76627-8_29","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T15:44:09Z","timestamp":1194277449000},"page":"383-393","source":"Crossref","is-referenced-by-count":9,"title":["A Self-stabilizing Weighted Matching Algorithm"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Manne","sequence":"first","affiliation":[]},{"given":"Morten","family":"Mjelde","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/571825.571877","volume-title":"PODC 2002","author":"S. Chattopadhyay","year":"2002","unstructured":"Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: PODC 2002. Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 290\u2013297. ACM Press, New York (2002)"},{"key":"29_CR2","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":"29_CR3","series-title":"Lecture Notes in Artificial Intelligence","first-page":"66","volume-title":"HiPC 2003","author":"W. Goddard","year":"2003","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing distributed algorithm for strong matching in a system graph. In: HiPC 2003. LNCS (LNAI), vol.\u00a02913, pp. 66\u201373. Springer, Heidelberg (2003)"},{"key":"29_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1109\/IPDPS.2003.1213302"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44681-8_67","volume-title":"Euro-Par 2001","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. LNCS, vol.\u00a02150, Springer, Heidelberg (2001)"},{"issue":"5","key":"29_CR6","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":"29_CR7","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":"29_CR8","first-page":"96","volume-title":"Sirocco 2007","author":"F. Manne","year":"2007","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. In: Sirocco 2007. Proceedings of the 14\n                  th\n                 International Colloquium on Structural Information and Communication Complexity, pp. 96\u2013108. Springer, Heidelberg (2007)"},{"issue":"6","key":"29_CR9","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."},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1077464.1077472","volume":"1","author":"D.E.D. Vinkemeier","year":"2005","unstructured":"Vinkemeier, D.E.D., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms\u00a01(1), 107\u2013122 (2005)","journal-title":"ACM Trans. Algorithms"}],"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-540-76627-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:28Z","timestamp":1619520928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76627-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76627-8_29","relation":{},"subject":[]}}