CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

DOI10.1142/S0218488504002576zbMath1087.68112OpenAlexW2133454512MaRDI QIDQ5696977

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

zbMATH Keywords

flagchain graphacyclic directed graphessential graphlegal merging

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

Unnamed Item ⋮ Learning Bayesian network structure: towards the essential graph by integer linear programming tools ⋮ A reconstruction algorithm for the essential graph ⋮ Characterization of inclusion neighbourhood in terms of the essential graph ⋮ 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 ⋮ On Block Ordering of Variables in Graphical Modelling

Cites Work

• Unnamed Item
• Unnamed Item
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Alternative Markov Properties for Chain Graphs
• Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Upper Neighbours
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

This page was built for publication: CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS