{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:21:07Z","timestamp":1768436467285,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385261","type":"print"},{"value":"9783642385278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_10","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"91-102","source":"Crossref","is-referenced-by-count":16,"title":["Hypergraph Transversal Computation with Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Takahisa","family":"Toda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","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":"10_CR2","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":"10_CR3","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. Fredman","year":"1996","unstructured":"Fredman, M., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021, 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96-97","author":"V. Gurvich","year":"1999","unstructured":"Gurvich, V., Khachiyan, L.: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Applied Mathematics\u00a096-97, 363\u2013373 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"L. Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Applied Mathematics\u00a0154, 2350\u20132372 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. In: Proc. of the Meeting on Algorithm Engineering & Experiments, ALENEX, New Orleans, Louisiana, USA, pp. 1\u201313 (January 2013)","DOI":"10.1137\/1.9781611972931.1"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G. Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowledge and Information Systems\u00a08, 178\u2013202 (2005)","journal-title":"Knowledge and Information Systems"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: Proc. of the 3rd IEEE International Conference on Data Mining, pp. 485\u2013488. IEEE Computer Society (November 2003)","DOI":"10.1109\/ICDM.2003.1250958"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7155\/jgaa.00107","volume":"9","author":"D. Kavvadias","year":"2005","unstructured":"Kavvadias, D., Stavropoulos, E.: An efficient algorithm for the transversal hypergraph generation. Journal of Graph Algorithms and Applications\u00a09(2), 239\u2013264 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.3233\/FUN-2007-80404","volume":"80","author":"C. H\u00e9rbert","year":"2007","unstructured":"H\u00e9rbert, C., Bretto, A., Cr\u00e9milleux, B.: A data mining formalization to improve hypergraph minimal transversal computation. Fundamental Informaticae\u00a080, 415\u2013433 (2007)","journal-title":"Fundamental Informaticae"},{"key":"10_CR11","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)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transaction on Computers"},{"key":"10_CR13","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.: Counterexamples 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":"10_CR14","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of 30th ACM\/IEEE Design Automation Conference, DAC 1993, Dallas, Texas, USA, pp. 272\u2013277 (June 1993)","DOI":"10.1145\/157485.164890"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Toda, T.: HTC-BDD: Hypergraph Transversal Computation with Binary Decision Diagrams (2013), http:\/\/kuma-san.net\/htcbdd.html (accessed on March 28)","DOI":"10.1007\/978-3-642-38527-8_10"},{"key":"10_CR16","unstructured":"Murakami, K., Uno, T.: Hypergraph Dualization Repository (2013), http:\/\/research.nii.ac.jp\/~uno\/dualization.html (accessed on January 19)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2006.09.006","volume":"101","author":"L. Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: A global parallel algorithm for the hypergraph transversal problem. Information Processing Letters\u00a0101, 148\u2013155 (2007)","journal-title":"Information Processing Letters"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDs. In: Proc. of the 1997 European Conference on Design and Test, Paris, France, pp. 224\u2013228 (March 1997)","DOI":"10.1109\/EDTC.1997.582363"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:14:15Z","timestamp":1746004455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}