Positive-instance driven dynamic programming for treewidth (Q5111757)
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: Positive-instance driven dynamic programming for treewidth |
scientific article; zbMATH DE number 7205046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Positive-instance driven dynamic programming for treewidth |
scientific article; zbMATH DE number 7205046 |
Statements
27 May 2020
0 references
treewidth
0 references
dynamic programming
0 references
minimal separators
0 references
potential maximal cliques
0 references
positive instances
0 references
Positive-Instance Driven Dynamic Programming for Treewidth. (English)
0 references
0.9959632754325868
0 references
0.7914549112319946
0 references
0.7895594239234924
0 references
0.7508272528648376
0 references
