A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1634919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficiently fast algorithm for finding close to optimal clique trees |
scientific article; zbMATH DE number 1634919 |
Statements
A sufficiently fast algorithm for finding close to optimal clique trees (English)
0 references
20 August 2001
0 references
clique tree algorithm
0 references
triangulation algorithm
0 references
Bayesian networks
0 references
3-way vertex cut problem
0 references
0 references
0.770926296710968
0 references
0.7667549848556519
0 references
0.7407722473144531
0 references
0.7337186336517334
0 references
