{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T13:20:54Z","timestamp":1779196854987,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016loi0002","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:19:52Z","timestamp":1501539592000},"page":"1556-1562","source":"Crossref","is-referenced-by-count":3,"title":["Power of Enumeration \u2014 Recent Topics on BDD\/ZDD-Based Techniques for Discrete Structure Manipulation"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Shin-ichi","family":"MINATO","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] R.E. Bryant, \u201cGraph-based algorithms for Boolean function manipulation,\u201d IEEE Transactions on Computers, vol.C-35, no.8, pp.677-691, 1986. 10.1109\/tc.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] S. Minato, \u201cZero-suppressed BDDs for set manipulation in combinatorial problems,\u201d Proc. of 30th ACM\/IEEE Design Automation Conference (DAC&apos;93), pp.272-277, 1993. 10.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"3","unstructured":"[3] D.E. Knuth, The Art of Computer Programming: Bitwise Tricks &amp; Techniques; Binary Decision Diagrams, Addison-Wesley, 2009."},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] S. Minato, \u201cTechniques of BDD\/ZDD: Brief history and recent activity,\u201d IEICE Transactions on Information and Systems, vol.E96-D, no.7, pp.1419-1429, 2013. 10.1587\/transinf.e96.d.1419","DOI":"10.1587\/transinf.E96.D.1419"},{"key":"5","unstructured":"[5] T. Inoue and et al., \u201cGraphillion.\u201d http:\/\/graphillion.org\/, 2013."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Inoue, H. Iwashita, J. Kawahara, and S. Minato, \u201cGraphillion: software library for very large sets of labeled graphs,\u201d International Journal on Software Tools for Technology Transfer (STTT), vol.18, no.1, pp.57-66, 2016.","DOI":"10.1007\/s10009-014-0352-z"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Minato, \u201cOverview of ERATO Minato project: The art of discrete structure manipulation between science and engineering,\u201d New Generation Computing, vol.29, no.2, pp.223-228, 2011. 10.1007\/s00354-011-0105-4","DOI":"10.1007\/s00354-011-0105-4"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] E. Loekit and J. Bailey, \u201cFast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams,\u201d Proc. The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD2006), pp.307-316, 2006.","DOI":"10.1145\/1150402.1150438"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Minato, \u201cVSOP (valued-sum-of-products) calculator for knowledge processing based on zero-suppressed BDDs,\u201d in Federation over the Web, ed. K. Jantke, A. Lunzer, N. Spyratos, and Y. Tanaka, Lecture Notes in Computer Science, vol.3847, pp.40-58, Springer Berlin Heidelberg, 2006. 10.1007\/11605126_3","DOI":"10.1007\/11605126_3"},{"key":"10","unstructured":"[10] S. Minato, T. Uno, and H. Arimura, \u201cLCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation,\u201d in Advances in Knowledge Discovery and Data Mining, ed. T. Washio, E. Suzuki, K. Ting, and A. Inokuchi, Lecture Notes in Computer Science, vol.5012, pp.234-246, Springer Berlin Heidelberg, 2008."},{"key":"11","unstructured":"[11] S. Minato, K. Satoh, and T. Sato, \u201cCompiling bayesian networks by symbolic probability calculation based on zero-suppressed BDDs,\u201d Proc. of 20th International Joint Conference of Artificial Intelligence (IJCAI-2007), pp.2550-2555, 2007."},{"key":"12","unstructured":"[12] M. Ishihata, Y. Kameya, T. Sato, and S. Minato, \u201cPropositionalizing the EM algorithm by BDDs,\u201d In Proc. of 18th International Conference on Inductive Logic Programming (ILP 2008), pp.44-49, 2008."},{"key":"13","unstructured":"[13] A. Darwiche, \u201cSDD: A new canonical representation of propositional knowledge bases,\u201d Proc. of 22nd International Joint Conference of Artificial Intelligence (IJCAI-2011), pp.819-826, 2011."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] R. Yoshinaka, T. Saitoh, J. Kawahara, K. Tsuruma, H. Iwashita, and S. Minato, \u201cFinding all solutions and instances of numberlink and slitherlink by ZDDs,\u201d Algorithms, vol.5, no.4, pp.176-213, 2012. 10.3390\/a5020176","DOI":"10.3390\/a5020176"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] R. Agrawal, T. Imieli\u0144ski, and A. Swami, \u201cMining association rules between sets of items in large databases,\u201d ACM SIGMOD Record, vol.22, no.2, pp.207-216, 1993. 10.1145\/170036.170072","DOI":"10.1145\/170036.170072"},{"key":"16","unstructured":"[16] B. Goethals, \u201cSurvey on frequent pattern mining,\u201d 2003. http:\/\/www.cs.helsinki.fi\/u\/goethals\/publications\/survey.ps."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] M.J. Zaki, \u201cScalable algorithms for association mining,\u201d IEEE Trans. Knowl. Data Eng., vol.12, no.3, pp.372-390, 2000. 10.1109\/69.846291","DOI":"10.1109\/69.846291"},{"key":"18","unstructured":"[18] T. Uno, Y. Uchida, T. Asai, and H. Arimura, \u201cLCM: an efficient algorithm for enumerating frequent closed item sets,\u201d Proc. Workshop on Frequent Itemset Mining Implementations (FIMI&apos;03), 2003. http:\/\/fimi.cs.helsinki.fi\/src\/."},{"key":"19","unstructured":"[19] \u201cNumber of nonintersecting (or self-avoiding) rook paths joining opposite corners of an <i>n<\/i>\u00d7<i>n<\/i> grid, the on-line encyclopedia of integer sequences,\u201d 2013. https:\/\/oeis.org\/A007764."},{"key":"20","unstructured":"[20] S. Doi and et al., \u201cTime with class! let&apos;s count! (the art of 10<sup>64<\/sup>-understanding vastness-),\u201d 2012. YouTube video, http:\/\/www.youtube.com\/watch?v=Q4gTV4r0zRs."},{"key":"21","unstructured":"[21] H. Iwashita, Y. Nakazawa, J. Kawahara, T. Uno, and S. Minato, \u201cEfficient computation of the number of paths in a grid graph with minimal perfect hash functions,\u201d Hokkaido University, Division of Computer Science, TCS Technical Reports, vol.TCS-TR-A-10-64, 2013."},{"key":"22","unstructured":"[22] Y. Hamuro and et al., \u201cEkillion.\u201d http:\/\/www.nysol.jp\/en\/home\/apps\/ekillion\/, 2014."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] T. Inoue, K. Takano, T. Watanabe, J. Kawahara, R. Yoshinaka, A. Kishimoto, K. Tsuda, S. Minato, and Y. Hayashi, \u201cDistribution loss minimization with guaranteed error bound,\u201d IEEE Transactions on Smart Grid, vol.5, no.1, pp.102-111, 2014. 10.1109\/tsg.2013.2288976","DOI":"10.1109\/TSG.2013.2288976"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] A. Takizawa, Y. Takechi, A. Ohta, N. Katoh, T. Inoue, T. Horiyama, J. Kawahara, and S. Minato, \u201cEnumeration of region partitioning for evalcuation planning based on zdd,\u201d Proc. of International symposium on Operation Research &amp; its Applications (ISORA2013), pp.64-71, 2014.","DOI":"10.1049\/cp.2013.2258"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] J. Kawahara, T. Horiyama, K. Hotta, and S. Minato, \u201cGenerating all patterns of graph partitions within a disparity bound,\u201d Proc. of the 11th International Workshop of Algorithms and Computation (WALCOM2017), (LNCS 10167, Springer), vol.10167, pp.119-131, 2007. 10.1007\/978-3-319-53925-6_10","DOI":"10.1007\/978-3-319-53925-6_10"},{"key":"26","unstructured":"[26] Japan Society for the Promotion of Science (JSPS), KAKENHI(S) 15H05711: Research on Core Algorithms for Discrete Structure Manipulation Systems, 6 2015. https:\/\/www.jsps.go.jp\/english\/e-grants\/grants07_2015.html#sogo."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOI0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T17:22:10Z","timestamp":1659288130000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOI0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016loi0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}