{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:39:25Z","timestamp":1774334365482,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_35","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:08Z","timestamp":1770977228000},"page":"529-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2100-0818","authenticated-orcid":false,"given":"Ryohei","family":"Okuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-044X","authenticated-orcid":false,"given":"Jun","family":"Kawahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1397-1020","authenticated-orcid":false,"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alet\u00e0, A., Codina, J.M., S\u00e1nchez, J., Gonz\u00e1lez, A.: Graph-partitioning based instruction scheduling for clustered processors. In: Proceedings. 34th ACM\/IEEE International Symposium on Microarchitecture, MICRO-34, pp. 150\u2013159 (2001). https:\/\/api.semanticscholar.org\/CorpusID:14320061","DOI":"10.1109\/MICRO.2001.991114"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22, 251\u2013256 (1979). https:\/\/api.semanticscholar.org\/CorpusID:14838769","DOI":"10.1145\/359094.359101"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63, 437\u2013461 (1996). https:\/\/api.semanticscholar.org\/CorpusID:14020472","DOI":"10.1007\/BF02125407"},{"key":"35_CR4","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo: a grounder and solver for logic programs. https:\/\/potassco.org\/clingo\/. Accessed 20 Sep 2025"},{"key":"35_CR5","unstructured":"Gonthier, G.: Formal proof\u2014the four- color theorem. In: Notices AMS 2008 (2008). https:\/\/api.semanticscholar.org\/CorpusID:12620754"},{"key":"35_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032497","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1994","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, Hoboken (1994)"},{"key":"35_CR7","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: 50 Years of Integer Programming (1972). https:\/\/api.semanticscholar.org\/CorpusID:33509266"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm (1998). https:\/\/api.semanticscholar.org\/CorpusID:353601","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th ACM\/IEEE Design Automation Conference, pp. 272\u2013277 (1993). https:\/\/api.semanticscholar.org\/CorpusID:11096308","DOI":"10.1145\/157485.164890"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs and their applications. Int. J. Softw. Tools Technol. Transfer 3, 156\u2013170 (2001). https:\/\/api.semanticscholar.org\/CorpusID:42919336","DOI":"10.1007\/s100090100038"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Smith, D.H., Hurley, S.: Bounds for the frequency assignment problem. Discret. Math. 167-168, 571\u2013582 (1997). https:\/\/api.semanticscholar.org\/CorpusID:205877697","DOI":"10.1016\/S0012-365X(96)00257-9"},{"key":"35_CR12","unstructured":"Takahashi, S., Yoshioka, M.: A proposal of a method for enumerating and indexing set partitions using ZDDs and its experimental evaluation. In: Proceedings of the JSAI Special Interest Group on Fundamental Problems in Artificial Intelligence (SIG-FPAI) (March 2020), no. 112, pp.\u00a008. The Japanese Society for Artificial Intelligence (JSAI)(In Japanese) (2020)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:16:32Z","timestamp":1774325792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}