Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs (Q1019493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs |
scientific article; zbMATH DE number 5560833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs |
scientific article; zbMATH DE number 5560833 |
Statements
Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs (English)
0 references
2 June 2009
0 references
conditional independence
0 references
graphical model
0 references
labelled block ordering
0 references
Markov equivalence
0 references
Markov property
0 references
partial ordering
0 references
well-ordering
0 references
0 references
0.82117724
0 references
0.8175303
0 references
0.8120543
0 references
0.8109633
0 references
0.8069688
0 references
0 references
0 references
0 references
0.8061429
0 references
