The traveling salesman problem for cubic graphs

David Eppstein
J. Graph Algorithms & Applications 11(1):61–81, 2007
Proc. 8th Int. Worksh. Algorithms and Data Structures (WADS 2003), Lecture Notes in Computer Science 2748, Frank K. H. A. Dehne, Jörg-Rudiger Sack, and Michiel Smid, ed., Springer-Verlag, 2003, pp. 307–318
ACM Computing Research Repository, cs.DS/0302030

Cited by:

• Space and time complexity of exact algorithms: some open problems