Characterization of inclusion neighbourhood in terms of the essential graph

DOI10.1016/j.ijar.2004.05.007zbMath1134.68515OpenAlexW2160034207MaRDI QIDQ1763167

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Knowledge representation (68T30)

Related Items (2)

A reconstruction algorithm for the essential graph ⋮ Structural Markov graph laws for Bayesian model uncertainty

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Causation, prediction, and search
• A characterization of Markov equivalence classes for acyclic digraphs
• On chain graph models for description of conditional independence structures
• A recovery algorithm for chain graphs
• Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Upper Neighbours
• 10.1162/153244303321897717
• 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

This page was built for publication: Characterization of inclusion neighbourhood in terms of the essential graph