{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:09:58Z","timestamp":1751285398724},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_39","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"364-373","source":"Crossref","is-referenced-by-count":7,"title":["All-cavity maximum matchings"],"prefix":"10.1007","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tak Wah","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. E. Bellman","year":"1958","unstructured":"R. E. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87\u201390, 1958.","journal-title":"Quarterly of Applied Mathematics"},{"key":"39_CR2","series-title":"LIDS Report P-1653","volume-title":"The auction algorithm: A distributed relaxation method for the assignment problem","author":"D. P. Bertsekas","year":"1987","unstructured":"D. P. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. LIDS Report P-1653, Massachusetts Institute of Technology, Cambridge, MA, 1987."},{"key":"39_CR3","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1991","unstructured":"T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1991."},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"N. Deo and C. Pang. Shortest-path algorithms: Taxonomy and annotation. Networks, 14:275\u2013323, 1984.","journal-title":"Networks"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"R. W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5:345, 1962.","journal-title":"Communications of the ACM"},{"key":"39_CR6","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596\u2013615, 1987.","journal-title":"Journal of the ACM"},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H. N. Gabow","year":"1985","unstructured":"H. N. Gabow. Scaling algorithms for network problems. Journal of Computer and System Sciences, 31:148\u2013168, 1985.","journal-title":"Journal of Computer and System Sciences"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H. N. Gabow","year":"1989","unstructured":"H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18:1013\u20131036, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H. N. Gabow","year":"1991","unstructured":"H. N. Gabow and R. E. Tarjan. Faster scaling. algorithms for general graphmatching problems. Journal of the ACM, 38:815\u2013853, 1991.","journal-title":"Journal of the ACM"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A. V. Goldberg","year":"1995","unstructured":"A. V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24:494\u2013504, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 7\u201318, 1987.","DOI":"10.1145\/28395.28397"},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp. An n\n5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2:225\u2013231, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D. B. Johnson","year":"1977","unstructured":"D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24:1\u201313, 1977.","journal-title":"Journal of the ACM"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"M. Y. Kao, T. W. Lam, T. M. Przytycka, W. K. Sung, and H. F. Ting. General techniques for comparing unrooted evolutionary trees. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 54\u201365, 1997.","DOI":"10.1145\/258533.258550"},{"key":"39_CR16","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1137\/0222071","volume":"22","author":"D. R. Karger","year":"1993","unstructured":"D. R. Karger, D. Koller, and S. J. Phillips. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM Journal on Computing, 22:1199\u20131217, 1993.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T15:41:31Z","timestamp":1549208491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}