{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:39:08Z","timestamp":1764783548129},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408960"},{"type":"electronic","value":"9783642408977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40897-7_19","type":"book-chapter","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T00:50:20Z","timestamp":1380502220000},"page":"281-293","source":"Crossref","is-referenced-by-count":5,"title":["Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems"],"prefix":"10.1007","author":[{"given":"Takahisa","family":"Toda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01, 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of 30th ACM\/IEEE Design Automation Conference (DAC 1993), pp. 272\u2013277 (June 1993)","DOI":"10.1145\/157485.164890"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ipl.2012.05.007","volume":"112","author":"R. Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Minato, S.: Counterexample to the long-standing conjecture on the complexity of BDD binary operations. Information Processing Letters\u00a0112, 636\u2013640 (2012)","journal-title":"Information Processing Letters"},{"key":"19_CR4","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDs. In: Proceedings of the 1997 European Conference on Design and Test (EDTC 1997), pp. 224\u2013228 (March 1997)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-30850-5_22","volume-title":"Experimental Algorithms","author":"M. Kiyomi","year":"2012","unstructured":"Kiyomi, M., Okamoto, Y., Saitoh, T.: Efficient enumeration of the directed binary perfect phylogenies from incomplete data. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 248\u2013259. Springer, Heidelberg (2012)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-38527-8_10","volume-title":"Experimental Algorithms","author":"T. Toda","year":"2013","unstructured":"Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 91\u2013102. Springer, Heidelberg (2013)"},{"key":"19_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-68125-0_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.I. Minato","year":"2008","unstructured":"Minato, S.I., Uno, T., Arimura, H.: LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 234\u2013246. Springer, Heidelberg (2008)"},{"key":"19_CR8","unstructured":"Minato, S.: Finding simple disjoint decompositions in frequent itemset data using Zero-suppressed BDDs. In: Proceedings of IEEE ICDM Workshop on Computational Intelligence in Data Mining, pp. 3\u201311 (2005)"},{"key":"19_CR9","unstructured":"Minato, S.: A fast algorithm for cofactor implication checking and its application for knowledge discovery. In: Proceedings of IEEE 8th International Conference on Computer and Information Technology (CIT 2008), pp. 53\u201358 (2008)"},{"key":"19_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11893318_35","volume-title":"Discovery Science","author":"S.-I. Minato","year":"2006","unstructured":"Minato, S.-I.: Symmetric Item Set Mining Based on Zero-Suppressed BDDs. In: Todorovski, L., Lavra\u010d, N., Jantke, K.P. (eds.) DS 2006. LNCS (LNAI), vol.\u00a04265, pp. 321\u2013326. Springer, Heidelberg (2006)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"654","DOI":"10.3390\/a5040654","volume":"5","author":"T. Toda","year":"2012","unstructured":"Toda, T.: Extracting co-occurrence relations from ZDDs. Algorithms\u00a05(4), 654\u2013667 (2012)","journal-title":"Algorithms"},{"key":"19_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39644-4_1","volume-title":"Discovery Science","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Makino, K.: Abduction and the dualization problem. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J. Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M., Cabeza, D. (eds.) PADL 2005. LNCS, vol.\u00a03350, pp. 174\u2013186. Springer, Heidelberg (2005)"},{"key":"19_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Discrete Applied Mathematics\u00a0156, 2035\u20132049 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR16","unstructured":"Nourine, L., Petit, J.M.: Extending set-based dualization: Application to pattern mining. In: Proceedings of 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 630\u2013635 (August 2012)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. In: Proceedings of the Meeting on Algorithm Engineering & Experiments (ALENEX 2013), pp. 1\u201313 (January 2013)","DOI":"10.1137\/1.9781611972931.1"},{"key":"19_CR18","unstructured":"Minato, S., Arimura, H.: Efficient method of combinatorial item set analysis based on Zero-Suppressed BDDs. In: Proceedings of IEEE\/IEICE\/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration, pp. 3\u201310 (April 2005)"},{"key":"19_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/11425274_71","volume-title":"Foundations of Intelligent Systems","author":"A. Salleb","year":"2005","unstructured":"Salleb, A., Vrain, C.: Estimation of the density of datasets with decision diagrams. In: Hacid, M.-S., Murray, N.V., Ra\u015b, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol.\u00a03488, pp. 688\u2013697. Springer, Heidelberg (2005)"},{"key":"19_CR20","unstructured":"Bentley, J., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 360\u2013369 (January 1997)"},{"key":"19_CR21","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"2011","unstructured":"Knuth, D.: The Art of Computer Programming, vol.\u00a04a. Addison-Wesley Professional, New Jersey (2011)"},{"issue":"7","key":"19_CR22","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1587\/transinf.E96.D.1419","volume":"E96-D","author":"S. Minato","year":"2013","unstructured":"Minato, S.: Techniques of BDD\/ZDD: Brief history and recent activity. IEICE Transactions on Information and Systems\u00a0E96-D(7), 1419\u20131429 (2013)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Watson, B.W., Mihov, S., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics\u00a026(1), 3\u201316 (2000)","journal-title":"Computational Linguistics"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Schoenhage","year":"1976","unstructured":"Schoenhage, A., Paterson, M., Pippenger, N.: Finding the median. Journal of Computer and Systems Sciences\u00a013, 184\u2013199 (1976)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R. Floyd","year":"1975","unstructured":"Floyd, R., Rivest, R.: Expected time bounds for selection. Communications of the ACM\u00a018(3), 165\u2013172 (1975)","journal-title":"Communications of the ACM"},{"key":"19_CR26","unstructured":"Toda, T.: ZCOMP: Fast Compression of Hypergraphs into ZDDs, \n                  \n                    http:\/\/kuma-san.net\/code\/zcomp.html\n                  \n                  \n                 (accessed on July 11, 2013)"},{"key":"19_CR27","unstructured":"Bentley, J., Sedgewick, R.: Fast algorithms for sorting and searching strings, \n                  \n                    http:\/\/www.cs.princeton.edu\/~rs\/strings\/\n                  \n                  \n                 (accessed on April 7, 2013)"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1229428.1229432","volume-title":"Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2007)","author":"G. Buehrer","year":"2007","unstructured":"Buehrer, G., Parthasarathy, S., Tatikonda, S., Kurc, T., Saltz, J.: Toward terabyte pattern mining: an architecture-conscious solution. In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2007), pp. 2\u201312. ACM, New York (2007)"},{"key":"19_CR29","unstructured":"Murakami, K., Uno, T.: Hypergraph dualization repository, \n                  \n                    http:\/\/research.nii.ac.jp\/~uno\/dualization.html\n                  \n                  \n                 (accessed on January 19, 2013)"},{"issue":"2-3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008699807402","volume":"10","author":"R. Bahar","year":"1997","unstructured":"Bahar, R., Frohm, E., Gaona, C., Hachtel, G., Macii, E., Pardo, A., Somenzi, F.: Algebric decision diagrams and their applications. Formal Methods in System Design\u00a010(2-3), 171\u2013206 (1997)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40897-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:29:29Z","timestamp":1558110569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40897-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408960","9783642408977"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40897-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}