Research map / Learning theory and algorithms / Combinatorial and search optimization
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Clique-Picking instead of the state-of-the-art counting solvers | Counting Markov equivalent DAGs · Random chordal graphs, subtree intersection | runtime: all instances in less than a minute; other solvers are not able to solve instances with more than 1024 vertices | Improved |
| Use Clique-Picking instead of AnonMAO | Counting Markov equivalent DAGs · Random interval graphs | solvable graph size: all instances; AnonMAO can not handle graphs with 256 or more vertices | Improved |
Closest papers by meaning
- A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton (AAAI 2024 · similarity 0.92)
- An Improved Clique-Picking Algorithm for Counting Markov Equivalent DAGs via Super Cliques Transfer (ICML 2025 · similarity 0.91)
- Causal Abstractions, Categorically Unified (NeurIPS 2026 · similarity 0.87)
- Interventional Causal Discovery in a Mixture of DAGs (NeurIPS 2024 · similarity 0.87)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · similarity 0.87)
- Relaxing partition admissibility in Cluster-DAGs: a causal calculus with arbitrary variable clustering (NeurIPS 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
