An approximation algorithm for finding long paths in Hamiltonian graphs

In this paper we present a polynomial-time algorithm that finds paths of length Omega((log n/ log log n)(2)) in undirected Hamiltonian graphs, improving the previous best of Omega(log n). (C) 2003 Elsevier Inc. All rights reserved