Zero-suppression and computation models

DOI10.1007/978-3-319-94667-2_22MaRDI QIDQ1671009zbMATH OpenOpenAlexFDO

Authors Hiroki Morizumi

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94667-2_22

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Zero-suppressed BDDs and their applications
• Chain reduction for binary and zero-suppressed decision diagrams
• Storing set families more compactly with top ZDDs
• Chain reduction for binary and zero-suppressed decision diagrams
• Characteristics of the maximal independent set ZDD

Cited in

(9)

• Zero-suppressed BDDs and their applications
• Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
• Extracting co-occurrence relations from ZDDs
• Zero-suppressed binary decision diagrams resilient to index faults
• Characteristics of the maximal independent set ZDD
• Boosting over non-deterministic ZDDs
• Chain reduction for binary and zero-suppressed decision diagrams
• Boosting over non-deterministic ZDDs
• Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams

This page was built for publication: Zero-suppression and computation models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671009)