Pages that link to "Item:Q2374537"
From MaRDI portal
The following pages link to Concise representations and construction algorithms for semi-graphoid independency models (Q2374537):
Displaying 4 items.
- A lattice-based representation of independence relations for efficient closure computation (Q2206476) (← links)
- Representing independence models with elementary triplets (Q2411286) (← links)
- Properties of semi-elementary imsets as sums of elementary imsets (Q2819983) (← links)
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (Q2880919) (← links)