CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
From MaRDI portal
Publication:5696977
DOI10.1142/S0218488504002576zbMATH Open1087.68112OpenAlexW2133454512MaRDI QIDQ5696977FDOQ5696977
Authors: Milan Studený 
Publication date: 19 October 2005
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218488504002576
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternative Markov properties for chain graphs
- A graphical characterization of the largest chain graphs
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- A recovery algorithm for chain graphs
- Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
Cited In (9)
- On Block Ordering of Variables in Graphical Modelling
- Two operations of merging and splitting components in a chain graph
- Characterization of inclusion neighbourhood in terms of the essential graph
- Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
- A reconstruction algorithm for the essential graph
- Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
- Title not available (Why is that?)
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- 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: CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696977)
