Storing set families more compactly with top ZDDs
From MaRDI portal
Publication:6487601
DOI10.4230/LIPICS.SEA.2020.6zbMATH Open1515.68102MaRDI QIDQ6487601FDOQ6487601
Authors: Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane 
Publication date: 7 February 2023
Recommendations
- DenseZDD: a compact and fast index for families of sets
- scientific article; zbMATH DE number 1982202
- On different topologies for set-indexing collections
- A compact data structure for representing a dynamic multiset
- An efficient algorithm for saving ordered sets in a compacted form
- Data structures for storing small sets in the bitprobe model
- scientific article; zbMATH DE number 177569
Cited In (9)
- DenseZDD: a compact and fast index for families of sets
- Characteristics of the maximal independent set ZDD
- Extracting co-occurrence relations from ZDDs
- Zero-suppressed binary decision diagrams resilient to index faults
- Boosting over non-deterministic ZDDs
- Zero-suppression and computation models
- Boosting over non-deterministic ZDDs
- Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams
- Zero-suppressed BDDs and their applications
This page was built for publication: Storing set families more compactly with top ZDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487601)
