Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2165094933 / rank | |||
Normal rank | |||
Revision as of 02:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions |
scientific article |
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
