| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427999 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We present an algorithm to find a Hamiltonian cycle in a proper interval graph in O(m+n) time, where m is the number of edges and n is the number of vertices in the graph. The algorithm is simpler and shorter than previous algorithms for the problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
