Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340)
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: Dynamic programming and planarity: improved tree-decomposition based algorithms |
scientific article; zbMATH DE number 5711871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming and planarity: improved tree-decomposition based algorithms |
scientific article; zbMATH DE number 5711871 |
Statements
Dynamic programming and planarity: improved tree-decomposition based algorithms (English)
0 references
25 May 2010
0 references
tree-decompositions
0 references
dynamic programming
0 references
planar dominating set
0 references
planar Hamiltonian cycle
0 references
planar graph TSP
0 references
branch-decompositions
0 references
0 references
0.9095304
0 references
0.9095304
0 references
0.90709114
0 references
0.9056948
0 references
0.9019711
0 references
0.8897375
0 references
0.8868966
0 references
