论文信息 - SOLVING THE HAMILTONIAN CYCLE PROBLEM USING SYMBOLIC DETERMINANTS

SOLVING THE HAMILTONIAN CYCLE PROBLEM USING SYMBOLIC DETERMINANTS

In this note we show how the Hamiltonian Cycle problem can be reduced to solving a system of polynomial equations related to the adjacency matrix of a graph. This system of equations can be solved using the method of Gr¨obner bases, but we also show how a symbolic determinant related to the adjacency matrix can be used to directly decide whether a graph has a Hamiltonian cycle.

[1] Anatoly D. Plotnikov. A logical model of HCP , 2001 .

[2] Martin Kreuzer,et al. Computational Commutative Algebra 1 , 2000 .

[3] Jerzy A. Filar,et al. Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes , 2003 .

[4] Eugene L. Lawler,et al. A Guided Tour of Combinatorial Optimization , 1985 .

[5] Donal O'Shea,et al. Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[6] Basil. Vandegriend,et al. Finding Hamiltonian cycles: algorithms, graphs and performance , 1998 .

[7] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[8] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[9] J. Gillis,et al. Matrix Iterative Analysis , 1961 .

[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.