Skip to content
#

tree-compression-algorithm

Here is 1 public repository matching this topic...

Language: OCaml
Filter by language

OCaml implementation of Zero-Suppressed Binary Decision Diagrams (ZDDs) — compressing binary decision trees via list-based and tree-based algorithms, with complexity analysis and experimental benchmarks on compression ratio and execution time.

  • Updated May 28, 2026
  • OCaml

Improve this page

Add a description, image, and links to the tree-compression-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the tree-compression-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more