A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:48, 30 January 2024
scientific article; zbMATH DE number 1634919
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
