{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:58Z","timestamp":1773481858809,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01758837","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:37:44Z","timestamp":1118918264000},"page":"89-101","source":"Crossref","is-referenced-by-count":7,"title":["Path-matching problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Sun","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01758837_CR1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"H. N. Gabow","year":"1988","unstructured":"Gabow, H. N. and R. E. Tarjan, Algorithms for two bottleneck optimization problems,J. Algorithms,9, (1988), 411\u2013417.","journal-title":"J. Algorithms"},{"key":"BF01758837_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R. M. Karp","year":"1975","unstructured":"Karp, R. M., On the complexity of combinatorial problems,Networks,5 (1975), 45\u201368.","journal-title":"Networks"},{"key":"BF01758837_CR3","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976."},{"key":"BF01758837_CR4","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H. and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"BF01758837_CR5","unstructured":"Wu S. and U. Manber, Algorithms for generalized matching, Technical Report, TR 88-39, Department of Computer Science, University of Arizona (November 1988)."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758837.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01758837\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:25:41Z","timestamp":1557332741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01758837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":5,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01758837"],"URL":"https:\/\/doi.org\/10.1007\/bf01758837","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}