{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:19Z","timestamp":1725488599178},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_49","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"428-431","source":"Crossref","is-referenced-by-count":3,"title":["A General Method for Graph Isomorphism"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Valiente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comp. Syst. Sci., 13(3):335\u2013379, 1976.","journal-title":"J. Comp. Syst. Sci."},{"issue":"2","key":"49_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0209025","volume":"9","author":"D. G. Corneil","year":"1980","unstructured":"D. G. Corneil and D. G. Kirkpatrick. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM J. Comput., 9(2):281\u2013297, 1980.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.3190030202","volume":"3","author":"G. Gati","year":"1979","unstructured":"G. Gati. Further annotated bibliography on the isomorphism disease. J. Graph Theory, 3(1):95\u2013109, 1979.","journal-title":"J. Graph Theory"},{"issue":"3","key":"49_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(73)80013-3","volume":"7","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. E. Tarjan. An O(n logn) algorithm for isomorphism of triconnected planar graphs. J. Comp. Syst. Sci., 7(3):323\u2013331, 1973.","journal-title":"J. Comp. Syst. Sci."},{"issue":"7","key":"49_CR5","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0031-3203(98)00145-9","volume":"32","author":"X. Y. Jiang","year":"1999","unstructured":"X. Y. Jiang and H. Bunke. Optimal quadratic-time isomorphism of ordered graphs. Pattern Recogn., 32(7):1273\u20131283, 1999.","journal-title":"Pattern Recogn."},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, and J. Tur\u00e1n. The Graph Isomorphism Problem: its Structural Complexity. Progress in Theoretical Computer Science. Birkh\u00e4user, 1993.","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"D. L. Kreher and D. R. Stinson. Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, 1999.","DOI":"10.1145\/309739.309744"},{"issue":"5","key":"49_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S. L. Mitchell","year":"1979","unstructured":"S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett., 9(5):229\u2013232, 1979.","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"49_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R. C. Read","year":"1977","unstructured":"R. C. Read and D. G. Corneil. The graph isomorphism disease. J. Graph Theory, 1(4):339\u2013363, 1977.","journal-title":"J. Graph Theory"},{"issue":"3","key":"49_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U. Sch\u00f6ning","year":"1988","unstructured":"U. Sch\u00f6ning. Graph isomorphism is in the low hierarchy. J. Comp. Syst. Sci., 37(3):312\u2013323, 1988.","journal-title":"J. Comp. Syst. Sci."},{"issue":"2","key":"49_CR11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","volume":"13","author":"L. Weinberg","year":"1966","unstructured":"L. Weinberg. A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. IEEE Trans. Circuit Theory, 13(2):142\u2013148, 1966.","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:13:02Z","timestamp":1556748782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}