The NPO-completeness of the longest Hamiltonian cycle problem
Journal
Information Processing Letters
Journal Volume
65
Journal Issue
3
Pages
119-123
Date Issued
1998
Author(s)
Abstract
In this paper, the longest Hamiltonian cycle problem and the longest Hamiltonian path problem are proved to be NPO-complete. © 1998 Published by Elsevier Science B.V.
Type
journal article