AI Paper Atlas

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

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 8 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
Use Clique-Picking instead of the state-of-the-art counting solversCounting Markov equivalent DAGs · Random chordal graphs, subtree intersectionruntime: all instances in less than a minute; other solvers are not able to solve instances with more than 1024 verticesImproved
Use Clique-Picking instead of AnonMAOCounting Markov equivalent DAGs · Random interval graphssolvable graph size: all instances; AnonMAO can not handle graphs with 256 or more verticesImproved

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