4 papers
Single Family Algebra Operation on BDDs and ZDDs Leads To Exponential Blow-Up
Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi
Binary decision diagram (BDD) and zero-suppressed binary decision diagram (ZDD) are data structures to represent a family of (sub)sets compactly, and it can be used as succinct ind…
International Competition on Graph Counting Algorithms 2023
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima +3
This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfyin…
Storing Set Families More Compactly with Top ZDDs
Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be d…
Variable Shift SDD: A More Succinct Sentential Decision Diagram
Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino
The Sentential Decision Diagram (SDD) is a tractable representation of Boolean functions that subsumes the famous Ordered Binary Decision Diagram (OBDD) as a strict subset. SDDs ar…