Research map / Graph learning / Graph algorithms and clustering
Counting and Sampling Markov Equivalent Directed Acyclic Graphs
Topi Talvitie, Mikko Koivisto
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 |
|---|---|---|---|
| memoize subproblems over induced subgraphs (dynamic programming, MemoMao) instead of plain recursion | He et al. 2015 sum-product recurrence · random UCCGs, n 16-1024, r 2-12 | running time | Improved |
| use tree-decomposition DP (TreeMao) instead of MemoMao | MAO counting · random UCCGs, median running time | running time | Mixed |
| use MemoMao instead of He & Yu 2016 core-graph method | MAO counting · random UCCGs | running time | Improved |
Closest papers by meaning
- An Improved Clique-Picking Algorithm for Counting Markov Equivalent DAGs via Super Cliques Transfer (ICML 2025 · similarity 0.93)
- A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton (AAAI 2024 · similarity 0.91)
- Markov Equivalence and Consistency in Differentiable Structure Learning (NeurIPS 2024 · similarity 0.87)
- Interventional Causal Discovery in a Mixture of DAGs (NeurIPS 2024 · similarity 0.87)
- ProDAG: Projected Variational Inference for Directed Acyclic Graphs (NeurIPS 2025 · similarity 0.87)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · 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.
