An approximation algorithm for finding long paths in Hamiltonian graphs

DOI10.1016/S0196-6774(03)00093-2zbMath1067.68110OpenAlexW4252035792MaRDI QIDQ4820883

Sundar Vishwanathan

Publication date: 1 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00093-2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: An approximation algorithm for finding long paths in Hamiltonian graphs