An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262)
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: An improved exact algorithm for TSP in graphs of maximum degree 4 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved exact algorithm for TSP in graphs of maximum degree 4 |
scientific article |
Statements
An improved exact algorithm for TSP in graphs of maximum degree 4 (English)
0 references
9 March 2016
0 references
traveling salesman problem
0 references
exact exponential algorithm
0 references
graph algorithm
0 references
measure-and-conquer
0 references
0 references
0 references
