{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:49Z","timestamp":1794527809427,"version":"4.9.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_11","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"157-172","source":"Crossref","is-referenced-by-count":4,"title":["Breaking Symmetries in Graphs: The Nauty Way"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avraham","family":"Itzhakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"RC Read","year":"1978","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107\u2013120 (1978)","journal-title":"Ann. Discrete Math."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jda.2015.01.011","volume":"31","author":"G J\u00e4ger","year":"2015","unstructured":"J\u00e4ger, G., Arnold, F.: SAT and IP based algorithms for magic labeling including a complete search for total magic labelings. J. Discrete Algorithms 31, 87\u2013103 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Puget, J.: On the satisfiability of symmetrical constrained satisfaction problems. In: Methodologies for Intelligent Systems, 7th International Symposium, ISMIS 1993, Trondheim, Norway, 15\u201318 June 1993, Proceedings, pp. 350\u2013361 (1993)","DOI":"10.1007\/3-540-56804-2_33"},{"key":"11_CR4","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), Cambridge, Massachusetts, USA, 5\u20138 November 1996, pp. 148\u2013159 (1996)"},{"issue":"12","key":"11_CR5","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.dam.2005.10.018","volume":"155","author":"I Shlyakhter","year":"2007","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. Discrete Appl. Math. 155(12), 1539\u20131548 (2007)","journal-title":"Discrete Appl. Math."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Walsh, T.: General symmetry breaking constraints. In: Principles and Practice of Constraint Programming - Cp. 2006, 12th International Conference, Cp. 2006, Nantes, France, 25\u201329 September 2006, Proceedings, pp. 650\u2013664 (2006)","DOI":"10.1007\/11889205_46"},{"key":"11_CR7","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) ECAI 2000, Proceedings of the 14th European Conference on Artificial Intelligence, Berlin, Germany, 20\u201325 August 2000, pp. 599\u2013603. IOS Press (2000)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10601-013-9154-2","volume":"19","author":"C Mears","year":"2013","unstructured":"Mears, C., de la Banda, G., Demoen, B., Wallace, M.: Lightweight dynamic symmetry breaking. Constraints 19(3), 195\u2013242 (2013)","journal-title":"Constraints"},{"key":"11_CR9","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments, SIAM, pp. 135\u2013149 (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"11_CR11","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-016-9244-z","volume":"21","author":"A Itzhakov","year":"2016","unstructured":"Itzhakov, A., Codish, M.: Breaking symmetries in graph search with canonizing sets. Constraints 21, 1\u201318 (2016)","journal-title":"Constraints"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1613\/jair.3809","volume":"46","author":"A Metodi","year":"2013","unstructured":"Metodi, A., Codish, M., Stuckey, P.J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems. J. Artif. Intell. Res. (JAIR) 46, 303\u2013341 (2013)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"11_CR14","unstructured":"Audemard, G., Simon, L.: Glucose 4.0 SAT Solver. http:\/\/www.labri.fr\/perso\/lsimon\/glucose\/"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"11_CR16","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Mat. Lapok 11, 264\u2013274 (1960). http:\/\/www.renyi.hu\/~p_erdos\/1961-05.pdf"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symbolic Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symbolic Comput."},{"key":"11_CR18","unstructured":"Codish, M., Miller, A., Prosser, P., Stuckey, P.J.: Breaking symmetries in graph representation. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, IJCAI\/AAAI (2013)"},{"key":"11_CR19","unstructured":"Sloane, N.J.A. (ed.): The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org Accessed April 2016"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T17:12:26Z","timestamp":1568308346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}