Exact Algorithms for Treewidth and Minimum Fill-In (Q3631902)
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 5567302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact Algorithms for Treewidth and Minimum Fill-In |
scientific article; zbMATH DE number 5567302 |
Statements
Exact Algorithms for Treewidth and Minimum Fill-In (English)
0 references
22 June 2009
0 references
exact exponential algorithm
0 references
treewidth
0 references
fill-in
0 references
minimal separators
0 references
potential maximal clique
0 references
minimal triangulation
0 references
0.9742341637611388
0 references
0.8911834955215454
0 references
0.8649696111679077
0 references
0.8645405173301697
0 references
0.8564629554748535
0 references
