Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653)
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: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions |
scientific article; zbMATH DE number 5791718
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions |
scientific article; zbMATH DE number 5791718 |
Statements
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (English)
0 references
27 September 2010
0 references
Exact and parameterized algorithms
0 references
Planar graphs
0 references
Treewidth
0 references
Branchwidth
0 references
Traveling salesman problem
0 references
Hamiltonian cycle
0 references
0 references
