TY  -  
T1  - Counting and Sampling Markov Equivalent Directed Acyclic Graphs 
SN  -  /  
UR  - http://hdl.handle.net/10138/306070 
T3  -  
A1  - Talvitie, Topi; Koivisto, Mikko 
A2  -  
PB  - AAAI Press 
Y1  - 2019 
LA  - eng 
AB  - Exploring directed acyclic graphs (DAGs) in a Markov equivalence class is pivotal to infer causal effects or to discover the causal DAG via appropriate interventional data. We consider counting and uniform sampling of DAGs that are Markov equivalent to a given DAG. These problems efficiently reduce to counting the moral acyclic orientations of a given undirected connected chordal graph on n vertices, for which we give two algorithms. Our first algorithm requires O(2(n)n(4)) arithmetic operations... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - ENUMERATION; NUMBER; 113 Computer and information sciences 
N1  -   
PP  -  
ER  -