{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:49:27Z","timestamp":1756464567566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031645280"},{"type":"electronic","value":"9783031645297"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64529-7_12","type":"book-chapter","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:21:35Z","timestamp":1721143295000},"page":"106-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Software for\u00a0Proper Vertex-Colouring Exploiting Graph Symmetry"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5836-8914","authenticated-orcid":false,"given":"Leonard H.","family":"Soicher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/9781009057226","volume-title":"Strongly Regular Graphs","author":"AE Brouwer","year":"2022","unstructured":"Brouwer, A.E., Van Maldeghem, H.: Strongly Regular Graphs. Cambridge University Press, Cambridge (2022)"},{"key":"12_CR2","unstructured":"The GAP Group: GAP \u2014 Groups, Algorithms, and Programming. Version 4.13.0 (2024). https:\/\/www.gap-system.org"},{"key":"12_CR3","unstructured":"The GAP Group: GAP \u2014 A Tutorial. Release 4.13.0 (2024). https:\/\/www.gap-system.org\/Manuals\/doc\/tut\/manual.pdf"},{"key":"12_CR4","volume-title":"Algorithmic Graph Theory","author":"A Gibbons","year":"1985","unstructured":"Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.jalgebra.2018.11.009","volume":"521","author":"C Jefferson","year":"2019","unstructured":"Jefferson, C., Jonauskyte, E., Pfeiffer, M., Waldecker, R.: Minimal and canonical images. J. Algebra 521, 481\u2013506 (2019)","journal-title":"J. Algebra"},{"key":"12_CR6","unstructured":"Jefferson, C., Pfeiffer, M., Waldecker, R., Jonauskyte, E.: The images package for GAP, minimal and canonical images. Version 1.3.2 (2024). https:\/\/gap-packages.github.io\/images\/"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Applegate, D. et al. (eds.) Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics, pp. 135\u2013149. SIAM, Philadelphia (2007). bliss homepage: http:\/\/www.tcs.hut.fi\/Software\/bliss\/","DOI":"10.1137\/1.9781611972870.13"},{"key":"12_CR8","volume-title":"Classification Algorithms for Codes and Designs","author":"P Kaski","year":"2006","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.R.J.: Classification Algorithms for Codes and Designs. Springer, Berlin (2006)"},{"key":"12_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81054-2","volume-title":"A Guide to Graph Colouring: Algorithms and Applications","author":"RMR Lewis","year":"2021","unstructured":"Lewis, R.M.R.: A Guide to Graph Colouring: Algorithms and Applications, 2nd edn. Springer International Publishing, Switzerland (2021)","edition":"2"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Linton, S.: Finding the smallest image of a set. In: J.\u00a0Gutierrez (ed.) ISSAC\u00a0\u201904: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp.\u00a0229\u2013234. ACM Press, New York (2004)","DOI":"10.1145\/1005285.1005319"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"McKay, B.\u00a0D., Piperno, A.: Practical graph isomorphism, II. J. Symbol. Comput. 60, 94\u2013112 (2014). nauty and Traces homepage: https:\/\/pallini.di.uniroma1.it","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"12_CR12","unstructured":"Soicher, L.H.: The GRAPE package for GAP. Version 4.9.0 (2022). https:\/\/gap-packages.github.io\/grape\/"},{"key":"12_CR13","first-page":"527","volume-title":"Algebraic Combinatorics and the Monster Group, London Mathematical Society Lecture Note Series 487","author":"LH Soicher","year":"2024","unstructured":"Soicher, L.H.: Using GAP packages for research in graph theory, design theory, and finite geometry. In: Ivanov, A.A. (ed.) Algebraic Combinatorics and the Monster Group, London Mathematical Society Lecture Note Series 487, pp. 527\u2013566. Cambridge University Press, Cambridge (2024)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64529-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:23:18Z","timestamp":1721143398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64529-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031645280","9783031645297"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64529-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/maths.dur.ac.uk\/icms2024\/ICMS2024.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}