On the Approximation of Finding A(nother
✍
Cristina Bazgan; Miklos Santha; Zsolt Tuza
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 144 KB
👁 1 views
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the co