Sciweavers

JGAA
2007

The Traveling Salesman Problem for Cubic Graphs

13 years 3 months ago
The Traveling Salesman Problem for Cubic Graphs
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
David Eppstein
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JGAA
Authors David Eppstein
Comments (0)