The Library
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Tools
Tools
Tools
UNSPECIFIED. (2006) Exact algorithms for the Hamiltonian cycle problem in planar graphs. OPERATIONS RESEARCH LETTERS, 34 (3). pp. 269-274. ISSN 0167-6377
Full text not available from this repository.
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 |
| Date: | May 2006 |
| Volume: | 34 |
| Number: | 3 |
| Number of Pages: | 6 |
| Page Range: | pp. 269-274 |
| Identification Number: | 10.1016/j.orl.2005.04.013 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/33786 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
