Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445)
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: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs |
scientific article; zbMATH DE number 803778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs |
scientific article; zbMATH DE number 803778 |
Statements
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (English)
0 references
9 October 1995
0 references
tree-decomposable graphs
0 references
dynamic programming
0 references
polynomial-time algorithms
0 references
0 references
0 references
0.88454676
0 references
0.8798544
0 references
0.8764784
0 references
0.8751386
0 references
0.87235564
0 references
0.87121516
0 references
0.8711768
0 references
