"An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on ..."

Wei-Kuan Shih, T. C. Chern, Wen-Lian Hsu (1992)

> Home

Details and statistics

DOI: 10.1137/0221061

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ShihCH92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ShihCH92
Wei-Kuan Shih, T. C. Chern, Wen-Lian Hsu:
An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs. SIAM J. Comput. 21(6): 1026-1046 (1992)

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.