An efficient algorithm for finding the largest chain graph according to a given chain graph (Q880872)
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: An efficient algorithm for finding the largest chain graph according to a given chain graph |
scientific article; zbMATH DE number 5157298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for finding the largest chain graph according to a given chain graph |
scientific article; zbMATH DE number 5157298 |
Statements
An efficient algorithm for finding the largest chain graph according to a given chain graph (English)
0 references
29 May 2007
0 references
graphical Markov model
0 references
chain graph
0 references
largest chain graph
0 references
protected arrows
0 references
efficient algorithm
0 references
0.854067862033844
0 references
0.8535171151161194
0 references
0.8269658088684082
0 references
0.7890307903289795
0 references
0.7727460861206055
0 references
