{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:55Z","timestamp":1725663295293},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127277"},{"type":"electronic","value":"9783540387145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12727-5_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:54:35Z","timestamp":1330174475000},"page":"284-299","source":"Crossref","is-referenced-by-count":2,"title":["An application of maximum bipartite c-matching to subtree isomorphism'"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"17_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho A., Hopcroft J. and Ullman J., The Design and Analysis of Computer Algorithms Addison-Wesley, Reading Mass., 1974."},{"key":"17_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge C., Graphs and Hypergraphs, North-Holland, Amsterdam, 1973."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chandra S., Stockmeyer L., Alternation, Proc. 17th FOCS, 1976, pp. 98\u2013108.","DOI":"10.1109\/SFCS.1976.4"},{"key":"17_CR4","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"M. Deo","year":"1974","unstructured":"Deo M., Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Inc. Englewood Cliffs, N.Y., 1974."},{"key":"17_CR5","unstructured":"Even S., Graph Algorithms, Computer Science Press, Inc., 1979."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hopcroft J., Karp R., An n 5\/2 Algorithms for Maximum Matching in Bipartite Graphs, SIAM J.Compt., Vol.4, No.4, 1975.","DOI":"10.1137\/0202019"},{"key":"17_CR7","volume-title":"Isomorphism of Planar Graphs, Complexity of Computer Computations","author":"J. Hopcroft","year":"1972","unstructured":"Hopcroft J., Tarjan R., Isomorphism of Planar Graphs, Complexity of Computer Computations, Plenum Press, N.Y. 1972."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Matula D., Subtree Isomorphism in O(n 5\/2), Annals of Discrete Mathematics 2, North-Holland Publishing Company, 1978.","DOI":"10.1016\/S0167-5060(08)70324-8"}],"container-title":["Lecture Notes in Computer Science","CAAP'83"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12727-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:11Z","timestamp":1605625571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12727-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127277","9783540387145"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-12727-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}