An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
From MaRDI portal
Publication:2880919
Recommendations
- Exploiting independencies to compute semigraphoid and graphoid structures
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
- scientific article; zbMATH DE number 1696627
- Approximation algorithms for independent sets in map graphs
- Reachability relations and the structure of transitive digraphs
- Independent transversal dominating sets in graphs: complexity and structural properties
- Complexity, Graphs, and the Dependency Pair Method
- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
- On weakly indexable graphs
- Concise representations and construction algorithms for semi-graphoid independency models
Cited in
(6)- Faithfulness and learning hypergraphs from discrete distributions
- An algorithm to find a perfect map for graphoid structures
- Reading dependencies from covariance graphs
- Faithfulness in chain graphs: the discrete case
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- A note on faithfulness and total positivity
This page was built for publication: An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880919)
