The traveling salesman problem for cubic graphs

Journal of Graph Algorithms and Applications

Volumn 11, Issue 1, 2007, Pages 61-81

  Eppstein, David ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 42149102808     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00137     Document Type: Article

References (15)

1. E. M. Arkin, M. Held, J. S. B. Mitchell, and S. S. Skiena. Hamiltonian triangulations for fast rendering. The Visual Computer, 12(9):429-444, 1996.
2. R. Beigel. Finding maximum independent sets in sparse and general graphs. In Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pages S856-S857, January 1999.
3. n) using maximal independent sets. Technical Report RS-02-45, BRICS, December 2002.
4. D. Eppstein. Quasiconvex analysis of backtracking algorithms. ACM Trans. Algorithms. To appear.
5. D. Eppstein. Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms and Applications, 7(2):131-140, 2003.
6. D. Eppstein and M. Gopi. Single-strip triangulation of manifolds with arbitrary topology. Eurographics Forum, 23(3):371-379, 2004.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
8. D. S. Johnson and L. A. McGeoch. The traveling salesman problem: a case study in local optimization. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215-310. John Wiley and Sons, 1997.
9. E. L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, 5(3):66-67, August 1976.
10. B. D. McKay and G. F. Royle. Constructing the cubic graphs on up to 20 vertices. Ars Combinatorica, 21(A):129-140, 1986.
11. J. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7(3):425-440, September 1986.
12. N. Schemenauer, T. Peters, and M. L. Hetland. Simple generators. Python Enhancement Proposal 255, python.org, May 2001.
13. R. E. Tarjan and A. E. Trojanowski. Finding a maximum independent set. SIAM J. Comput., 6(3):537-546, September 1977.
14. G. van Rossum et al. Python Language Website. http://www.python.org/.
15. B. Vandegriend. Finding Hamiltonian Cycles: Algorithms, Graphs and Performance. Master's thesis, Univ. of Alberta, Dept. of Computing Science, 1998.