{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:12Z","timestamp":1749825852136},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T00:00:00Z","timestamp":1234224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00607-009-0025-z","type":"journal-article","created":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T04:13:36Z","timestamp":1234152816000},"page":"121-138","source":"Crossref","is-referenced-by-count":3,"title":["Stabilizing maximum matching in bipartite networks"],"prefix":"10.1007","volume":"84","author":[{"given":"Rachid","family":"Hadid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Hakan","family":"Karaata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,10]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A Arora","year":"1994","unstructured":"Arora A, Gouda MG (1994) Distributed reset. IEEE Trans Comput 43: 1026\u20131038","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"25_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00446-004-0111-6","volume":"17","author":"A Arora","year":"2005","unstructured":"Arora A, Nesterenko M (2005) Unifying stabilization and termination in message-passing systems. Distrib Comput 17(3): 279\u2013290","journal-title":"Distrib Comput"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge C (1957) Two theorems in graph theory. Proc Natl Acad Sci 43: 842\u2013844","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"25_CR4","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1109\/12.24293","volume":"38","author":"GM Brown","year":"1989","unstructured":"Brown GM, Gouda MG, Wu CL (1989) Token systems that self-stabilize. IEEE Trans Comput 38(6): 844\u2013852","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"25_CR5","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/S0097539798427156","volume":"29","author":"SC Bruell","year":"1999","unstructured":"Bruell SC, Ghosh S, Karaata MH, Pemmaraju SV (1999) Self-stabilizing algorithms for finding centers and medians of trees. SIAM J Comput 29(2): 600\u2013614","journal-title":"SIAM J Comput"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"JE Burns","year":"1989","unstructured":"Burns JE, Pachl J (1989) Uniform self-stabilizing rings. ACM Trans Program Lang Syst 11: 330\u2013344","journal-title":"ACM Trans Program Lang Syst"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Chattopadhyay S, Higham L, Seyffarth K (2002) Dynamic and self-stabilizing distributed matching. In: PODC, pp 290\u2013297","DOI":"10.1145\/571825.571877"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Cournier A, Datta AK, Petit F, Villain V (2001) Self-stabilizing PIF algorithm in arbitrary rooted networks. In: Proceedings of 21st IEEE international conference on distributed computing systems, pp 91\u201398","DOI":"10.1109\/ICDSC.2001.918937"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Cournier A, Devismes S, Villain V (2006). Snap-stabilizing pif and useless computations. In: ICPADS\u201906: Proceedings of the 12th international conference on parallel and distributed systems. IEEE Computer Society, Washington, DC, USA, pp 39\u201348","DOI":"10.1109\/ICPADS.2006.100"},{"key":"25_CR10","first-page":"231","volume-title":"SSS. Lecture notes in computer science, vol 4280","author":"A Dasgupta","year":"2006","unstructured":"Dasgupta A, Ghosh S, Tixeuil S (2006) Selfish stabilization. In: Datta AK, Gradinariu M (eds) SSS. Lecture notes in computer science, vol 4280. Springer, Berlin, pp 231\u2013243"},{"issue":"4","key":"25_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/PL00008919","volume":"13","author":"AK Datta","year":"2000","unstructured":"Datta AK, Johnen C, Petit F, Villain V (2000) Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distrib Comput 13(4): 207\u2013218","journal-title":"Distrib Comput"},{"issue":"11","key":"25_CR12","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11): 643\u2013644. doi: 10.1145\/361179.361202","journal-title":"Commun ACM"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17: 449\u2013467","journal-title":"Can J Math"},{"issue":"1","key":"25_CR14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil Z (1986) Efficient algorithms for finding maximum matchings in graphs. ACM Comput Surv 18(1): 171\u2013175","journal-title":"ACM Comput Surv"},{"key":"25_CR15","first-page":"129","volume-title":"Self-stabilizing systems. Lecture notes in computer science, vol 2704","author":"S Ghosh","year":"2003","unstructured":"Ghosh S, Bejan A (2003) A framework of safe stabilization. In: Huang S-T, Herman T (eds) Self-stabilizing systems. Lecture notes in computer science, vol 2704. Springer, Berlin, pp 129\u2013140"},{"issue":"3\u20134","key":"25_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(00)00006-5","volume":"73","author":"S Ghosh","year":"2000","unstructured":"Ghosh S, He X (2000) Fault-containing self-stabilization using priority scheduling. Inf Process Lett 73(3\u20134): 145\u2013151","journal-title":"Inf Process Lett"},{"key":"25_CR17","volume-title":"Algorithmic graph theory","author":"A Gibbons","year":"1985","unstructured":"Gibbons A (1985) Algorithmic graph theory. Cambridge University Press, Cambridge"},{"issue":"2","key":"25_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/32.988499","volume":"28","author":"MG Gouda","year":"2002","unstructured":"Gouda MG (2002) Multiphase stabilization. IEEE Trans Softw Eng 28(2): 201\u2013208","journal-title":"IEEE Trans Softw Eng"},{"issue":"1","key":"25_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00446-007-0033-1","volume":"20","author":"MG Gouda","year":"2007","unstructured":"Gouda MG, Haddix FF (2007) The alternator. Distrib Comput 20(1): 21\u201328","journal-title":"Distrib Comput"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft JE, Karp RM (1973) An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2: 225\u2013231","journal-title":"SIAM J Comput"},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02278857","volume":"7","author":"S-T Huang","year":"1993","unstructured":"Huang S-T, Chen N-S (1993) Self-stabilizing depth-first token circulation on networks. Distrib Comput 7: 61\u201366","journal-title":"Distrib Comput"},{"issue":"3","key":"25_CR22","first-page":"175","volume":"15","author":"MH Karaata","year":"2000","unstructured":"Karaata MH, Saleh KA (2000) A distributed self-stabilizing algorithm for finding maximum matching. Comput Syst Sci Eng 15(3): 175\u2013180","journal-title":"Comput Syst Sci Eng"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02278852","volume":"7","author":"S Katz","year":"1993","unstructured":"Katz S, Perry KJ (1993) Self-stabilizing extensions for message-passing systems. Distrib Comput 7: 17\u201326","journal-title":"Distrib Comput"},{"key":"25_CR24","unstructured":"Micali S, Vazirani VV (1980) An O(sqrt(|v|) |e|) algorithm for finding maximum matching in general graphs. In: FOCS. IEEE, pp 17\u201327"},{"issue":"2","key":"25_CR25","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1006\/jpdc.2001.1828","volume":"65","author":"M Nesterenko","year":"2002","unstructured":"Nesterenko M, Arora A (2002) Stabilization-preserving atomicity refinement. J Parallel Distrib Comput 65(2): 766\u2013791","journal-title":"J Parallel Distrib Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0025-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-009-0025-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0025-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:30:21Z","timestamp":1559125821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-009-0025-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,10]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s00607-009-0025-z","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,10]]}}}