{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:43Z","timestamp":1726406683105},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108283"},{"type":"electronic","value":"9783540387169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_70","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:26:08Z","timestamp":1330172768000},"page":"290-307","source":"Crossref","is-referenced-by-count":0,"title":["Certain algorithms for subgraph isomorphism problems"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"20_CR1","unstructured":"Aho A.V., Hopcroft J.E., Ullman J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1976."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Filotti I.S., Mayer J.N., Apolynomial-time algorithm for determining the isomorphism of graphs of fixed genus, ACM symposium on Theory of Computing, 1980.","DOI":"10.1145\/800141.804671"},{"key":"20_CR3","first-page":"4","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey M.R., Johnson D.S. and Tarjan R.E., The planar Hamiltonian circuit problem is NP-complete, SIAM J. Compt. vol 5, no 4, 1976.","journal-title":"SIAM J. Compt. vol"},{"key":"20_CR4","volume-title":"Pattern Recognition Principles","author":"R.C. Gonzalez","year":"1974","unstructured":"Gonzalez R.C., Tou J.T., Pattern Recognition Principles, Addison-Wesley, Massachusetts, 1974."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Harary F., Graph Theory, Addison-Wesley, 1969.","DOI":"10.21236\/AD0705364"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Hopcroft J.E., Wong J., Linear time Algorithm for Isomorphism of Planar Graphs, 6th ACM symp. on Theory of Computing, 1974.","DOI":"10.1145\/800119.803896"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Hopcroft J.E., Tarjan R., Isomorphism of planar graphs, 4th An. Symp. on the Theory of Computing, 1972.","DOI":"10.1007\/978-1-4684-2001-2_13"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Hopcroft J.E., Karp R.M., An n5\/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Compt. vol 2, 1973.","DOI":"10.1137\/0202019"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Leiserson C.E., Area-Efficient Graph Layouts, 21 st FOCS symposium, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"20_CR10","unstructured":"Lipton R.J., Tarjan R.E., A separator theorem for planar graphs, Stanford Univ. 1977, CS-77-627."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Lipton R.J., Tarjan R.E., Applications of a planar separator theorem, Stanford Univ. 1977, CS-77-628.","DOI":"10.1109\/SFCS.1977.6"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Miller G., Isomorphism testing for graphs of bounded genus, ACM symposium on Theory of Computing, 1980.","DOI":"10.1145\/800141.804670"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Read R.C., Corneil D.G., The graph isomorphism disease, J. of Graph Theory, no 4, 1977.","DOI":"10.1002\/jgt.3190010410"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Schmidt D.C., Druffel L. E., A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices, J.ACM, 1976, 433\u2013445.","DOI":"10.1145\/321958.321963"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Ullmann J.R., An algorithm for subgraph isomorphism, J.ACM, vol 23, no 1, 1976.","DOI":"10.1145\/321921.321925"}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:03:31Z","timestamp":1605625411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}