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 e...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.展开更多
基金This research was partly supported by the National Natural Science Foundation of China(Grant Nos.39930160&19871003).
文摘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.
