{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:31Z","timestamp":1725532831260},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_21","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T05:12:20Z","timestamp":1243919540000},"page":"221-232","source":"Crossref","is-referenced-by-count":8,"title":["Fast Algorithm for Graph Isomorphism Testing"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Luis","family":"L\u00f3pez-Presa","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: FOCS 2002 (2002)","DOI":"10.1109\/SFCS.2002.1181999"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Ku\u010dera, L.: Canonical labeling of graphs in linear average time. In: FOCS 1979 (1979)","DOI":"10.1109\/SFCS.1979.8"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC 1983 (1983)","DOI":"10.1145\/800061.808746"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"Boppana, R., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Information Processing Letters\u00a025, 27\u201332 (1987)","journal-title":"Information Processing Letters"},{"key":"21_CR5","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proc.\u00a0of the 3rd IAPR-TC-15 Int\u2019l Workshop on Graph-based Representations (2001)"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jda.2007.01.002","volume":"6","author":"T. Czajka","year":"2008","unstructured":"Czajka, T., Pandurangan, G.: Improved random graph isomorphism. J.\u00a0of Discrete Algorithms\u00a06(1), 85\u201392 (2008)","journal-title":"J.\u00a0of Discrete Algorithms"},{"key":"21_CR7","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report TR 96-20, U.\u00a0of Alberta, Edmonton, Alberta, Canada (July 1996)"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.3190030202","volume":"3","author":"G. Gati","year":"2006","unstructured":"Gati, G.: Further annotated bibliography on the isomorphism disease. J.\u00a0of Graph Theory\u00a03(2), 95\u2013109 (2006)","journal-title":"J.\u00a0of Graph Theory"},{"key":"21_CR9","series-title":"Discrete Mathematics and its Applications","first-page":"68","volume-title":"Handbook of graph theory","author":"M. Goldberg","year":"2003","unstructured":"Goldberg, M.: The graph isomorphism problem. In: Gross, J.L., Yellen, J. (eds.) Handbook of graph theory. Discrete Mathematics and its Applications, ch.\u00a02.2, pp. 68\u201378. CRC Press, Boca Raton (2003)"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R. Mathon","year":"1979","unstructured":"Mathon, R.: A note on the graph isomorphism counting problem. Information Processing Letters\u00a08(3), 131\u2013132 (1979)","journal-title":"Information Processing Letters"},{"key":"21_CR11","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congr.\u00a0Numer.\u00a030, 45\u201387 (1981)","journal-title":"Congr.\u00a0Numer."},{"key":"21_CR12","unstructured":"McKay, B.D.: The nauty page. CS Dept., Australian National U. (2004), http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Miyazaki, T.: The complexity of McKay\u2019s canonical labeling algorithm. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation II. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a028 (1997)","DOI":"10.1090\/dimacs\/028\/14"},{"key":"21_CR14","unstructured":"L\u00f3pez Presa, J.L.: Efficient Algorithms for Graph Isomorphism Testing. Ph.D thesis, ETSI Telecomunicaci\u00f3n, U.\u00a0Rey Juan Carlos, Madrid, Spain (March 2009), http:\/\/www.diatel.upm.es\/jllopez\/tesis\/thesis.pdf"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R.C. Read","year":"1977","unstructured":"Read, R.C., Corneil, D.G.: The graph isomorphism disease. J.\u00a0of Graph Theory\u00a01, 339\u2013363 (1977)","journal-title":"J.\u00a0of Graph Theory"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U. Sch\u00f6ning","year":"1988","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. J.\u00a0of Computer and System Sciences\u00a037(3), 312\u2013323 (1988)","journal-title":"J.\u00a0of Computer and System Sciences"},{"key":"21_CR17","unstructured":"Singler, J.: Graph isomorphism implementation in LEDA 5.1. Technical report, Algorithmic Solutions Software GmbH (December 2005)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J.\u00a0ACM\u00a023(1) (1976)","DOI":"10.1145\/321921.321925"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:55:27Z","timestamp":1558349727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}