ICAR Research Data Repository for Knowledge Management
DSpace at IIT Bombay
View Archive InfoMetadata
| Field | Value |
| Title | An approximation algorithm for finding long paths in Hamiltonian graphs |
| Names |
VISHWANATHAN, S
(author) |
| Date Issued | 2004 (iso8601) |
| Abstract | In this paper we present a polynomial-time algorithm that finds paths of length Omega((log n/ log log n)(2)) in undirected Hamiltonian graphs, improving the previous best of Omega(log n). (C) 2003 Elsevier Inc. All rights reserved. |
| Genre | Article; Proceedings Paper |
| Identifier | 0196-6774 |
| Related Item | |
| Related Item | |