Characterization of inclusion neighbourhood in terms of the essential graph
DOI10.1016/J.IJAR.2004.05.007zbMATH Open1134.68515OpenAlexW2160034207MaRDI QIDQ1763167FDOQ1763167
Authors: Milan Studený 
Publication date: 22 February 2005
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2004.05.007
Recommendations
- Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
- 10.1162/153244304773936045
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- A geometric view on learning Bayesian network structures
- A characterization of Markov equivalence classes for acyclic digraphs
Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Stochastic network models in operations research (90B15)
Cites Work
- Causation, prediction, and search
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244303321897717
- On chain graph models for description of conditional independence structures
- Title not available (Why is that?)
- A recovery algorithm for chain graphs
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
Cited In (5)
Uses Software
This page was built for publication: Characterization of inclusion neighbourhood in terms of the essential graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763167)
