AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Counting and Sampling Markov Equivalent Directed Acyclic Graphs

Topi Talvitie, Mikko Koivisto

AAAI 2019 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 14 citations (OpenAlex)

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 changedWhereMeasuredEffect
memoize subproblems over induced subgraphs (dynamic programming, MemoMao) instead of plain recursionHe et al. 2015 sum-product recurrence · random UCCGs, n 16-1024, r 2-12running timeImproved
use tree-decomposition DP (TreeMao) instead of MemoMaoMAO counting · random UCCGs, median running timerunning timeMixed
use MemoMao instead of He & Yu 2016 core-graph methodMAO counting · random UCCGsrunning timeImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy