The Library
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Tools
UNSPECIFIED (2006) Exact algorithms for the Hamiltonian cycle problem in planar graphs. OPERATIONS RESEARCH LETTERS, 34 (3). pp. 269-274. doi:10.1016/j.orl.2005.04.013 ISSN 0167-6377.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.orl.2005.04.013
Abstract
We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs with worst case time complexity O(c(root n)), where c is some fixed constant that does not depend on the instance. Furthermore, we show that under the exponential time hypothesis, the time complexity cannot be improved to O(c(o(root n))). (c) 2005 Elsevier B.V. All rights reserved.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management | ||||
Journal or Publication Title: | OPERATIONS RESEARCH LETTERS | ||||
Publisher: | ELSEVIER SCIENCE BV | ||||
ISSN: | 0167-6377 | ||||
Official Date: | May 2006 | ||||
Dates: |
|
||||
Volume: | 34 | ||||
Number: | 3 | ||||
Number of Pages: | 6 | ||||
Page Range: | pp. 269-274 | ||||
DOI: | 10.1016/j.orl.2005.04.013 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |