On the Markov equivalence of maximal ancestral graphs

摘要

Necessary and sufficient conditions for a maximal ancestral graph (MAnG) to be Markov equivalent to another MAnG and to a DAG are provided respectively. Also a polynomial-time algorithm for converting a MAnG into its equivalent DAG is given for the first time.