{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T08:42:15Z","timestamp":1753519335338},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:04:04Z","timestamp":1330193044000},"page":"454-464","source":"Crossref","is-referenced-by-count":18,"title":["Node weighted matching"],"prefix":"10.1007","author":[{"given":"Thomas H.","family":"Spencer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, Trees, and Flowers. Canad. J. Math.\n17 (1965), pp. 449\u2013467.","journal-title":"Canad. J. Math."},{"key":"42_CR2","unstructured":"Galil, Z., Micali, S., Gabow, H.: Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Mathching in General Graphs. Proc. 23rd Annual Symposium on Foundations of Computer Science, (1982), pp. 255\u2013261."},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., Karp, R. M.: An n\n5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. on Comput.\n2 (1973), pp. 225\u2013231.","journal-title":"SIAM J. on Comput."},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.4153\/CJM-1958-027-8","volume":"10","author":"N. S. Mendelson","year":"1958","unstructured":"Mendelson, N. S., Dulmage, A. L.: Some generalizations of the problem of distinct representatives. Canad. J. Math.\n10 (1958) pp.230\u2013241.","journal-title":"Canad. J. Math."},{"key":"42_CR5","unstructured":"Micali, S., Vazirani, V. V.: An O(\u221a|V||E|) Algorithm for Finding Maximum Matchings in General Graphs. Proc. 21st Annual Symposium on Foundations of Computer Science, (1981), pp. 17\u201327."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"Tarjan, R. E.: Efficiency of a Good But Not Linear Set Union Algorithm. JACM 22 (1975), p. 215\u2013225.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:51Z","timestamp":1619556771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}