Title of article
The NPO-completeness of the longest Hamiltonian cycle problem
Author/Authors
Q. S. Wu، نويسنده , , K. M. Chao، نويسنده , , R. C. T. Lee، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1998
Pages
5
From page
119
To page
123
Keywords
computational complexity , NPO-complete , Longest Hamiltonian cycle problem , Longest traveling salespersonproblem , Strict reduction
Journal title
Information Processing Letters
Serial Year
1998
Journal title
Information Processing Letters
Record number
128826
Link To Document