An efficient algorithm for finding the largest chain graph according to a given chain graph

MaRDI QIDQ880872zbMATH OpenFDO

Authors Baijun Liu, Zhongguo Zheng, Hui Zhao

Publication date 29 May 2007

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

chain graphefficient algorithmgraphical Markov modellargest chain graphprotected arrows

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial probability (60C05) Probabilistic measure theory (60A10)

Recommendations

• A recovery algorithm for chain graphs
• A graphical characterization of the largest chain graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• Characterizing Markov equivalence classes for AMP chain graph models

Cited in

(3)

• scientific article; zbMATH DE number 5521183 (Why is no real title available?)
• Chain graph interpretations and their relations revisited
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

This page was built for publication: An efficient algorithm for finding the largest chain graph according to a given chain graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880872)