"The NPO-Completeness of the Longest Hamiltonian Cycle Problem."

Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee (1998)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(98)00003-9

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/WuCL98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/WuCL98
Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee:
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.