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 the normal view instead:
scientific article; zbMATH DE number 5791718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9597439169883728
0 references
0.8909314274787903
0 references
0.8094031810760498
0 references
0.7947489619255066
0 references
