{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:02Z","timestamp":1746115862370,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_27","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"296-307","source":"Crossref","is-referenced-by-count":0,"title":["Novel Techniques for Automorphism Group Computation"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Luis","family":"L\u00f3pez-Presa","sequence":"first","affiliation":[]},{"given":"Luis N\u00fa\u00f1ez","family":"Chiroque","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Graph matching applications in pattern recognition and image processing. In: ICIP, Barcelona, Spain, vol.\u00a02, pp. 21\u201324 (September 2003)","DOI":"10.1109\/ICIP.2003.1246606"},{"issue":"1","key":"27_CR2","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. Journal of Discrete Algorithms\u00a06(1), 85\u201392 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for cnf. In: DAC, pp. 530\u2013534 (2004)","DOI":"10.1145\/996566.996712"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1021\/ci9702914","volume":"38","author":"J.-L. Faulon","year":"1998","unstructured":"Faulon, J.-L.: Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial\u2013time for molecular graphs. Journal of Chemical Information and Computer Science\u00a038, 432\u2013444 (1998)","journal-title":"Journal of Chemical Information and Computer Science"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-19754-3_16","volume-title":"Theory and Practice of Algorithms in (Computer) Systems","author":"T. Junttila","year":"2011","unstructured":"Junttila, T., Kaski, P.: Conflict propagation and component recursion for canonical labeling. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol.\u00a06595, pp. 151\u2013162. Springer, Heidelberg (2011)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Junttila, T.A., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-14186-7_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"H. Katebi","year":"2010","unstructured":"Katebi, H., Sakallah, K.A., Markov, I.L.: Symmetry and satisfiability: An update. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 113\u2013127. Springer, Heidelberg (2010)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-28717-6_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"H. Katebi","year":"2012","unstructured":"Katebi, H., Sakallah, K.A., Markov, I.L.: Conflict anticipation in the search for graph automorphisms. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol.\u00a07180, pp. 243\u2013257. Springer, Heidelberg (2012)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Katebi, H., Sakallah, K.A., Markov, I.L.: Graph symmetry detection and canonical labeling: Differences and synergies. In: Turing-100. EPiC Series, vol.\u00a010, pp. 181\u2013195 (2012)","DOI":"10.29007\/gzc1"},{"key":"27_CR10","unstructured":"Presa, J.L.L.: Efficient Algorithms for Graph Isomorphism Testing. PhD thesis, ETSIT, Universidad Rey Juan Carlos, Madrid, Spain (March 2009)"},{"key":"27_CR11","unstructured":"L\u00f3pez-Presa, J.L., Chiroque, L.N., Anta, A.F.: Benchmark graphs for evaluating graph isomorphism algorithms. Conauto website by Google sites (2011), http:\/\/sites.google.com\/site\/giconauto\/home\/benchmarks"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-02011-7_21","volume-title":"Experimental Algorithms","author":"J.L. L\u00f3pez-Presa","year":"2009","unstructured":"L\u00f3pez-Presa, J.L., Fern\u00e1ndez Anta, A.: Fast algorithm for graph isomorphism testing. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 221\u2013232. Springer, Heidelberg (2009)"},{"key":"27_CR13","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"27_CR14","unstructured":"McKay, B.D.: The nauty page. Computer Science Department, Australian National University (2010), http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, ii (2013)","DOI":"10.1201\/b16132-9"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Miyazaki, T.: The complexity of McKay\u2019s canonical labeling algorithm. In: Groups and Computation II, pp. 239\u2013256. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/028\/14"},{"key":"27_CR17","unstructured":"Piperno, A.: Search space contraction in canonical labeling of graphs (preliminary version). CoRR, abs\/0804.4881 (2008)"},{"key":"27_CR18","unstructured":"Tener, G.: Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms. Phd thesis, University of Central Florida (2009)"},{"key":"27_CR19","first-page":"203","volume":"64","author":"G. Tener","year":"2008","unstructured":"Tener, G., Deo, N.: Attacks on hard instances of graph isomorphism. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a064, 203\u2013226 (2008)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"27_CR20","unstructured":"Tinhofer, G., Klin, M.: Algebraic combinatorics in mathematical chemistry. Methods and algorithms III. Graph invariants and stabilization methods. Technical Report TUM-M9902, Technische Universit\u00e4t M\u00fcnchen (March 1999)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Weisfeiler, B. (ed.): On construction and identification of graphs. Lecture Notes in Mathematics, vol.\u00a0558 (1976)","DOI":"10.1007\/BFb0089374"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:14:29Z","timestamp":1746004469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}