An approximation algorithm for finding long paths in Hamiltonian graphs |
| |
Authors: | Sundar Vishwanathan |
| |
Affiliation: | Department of Computer Science and Engineering, IIT, Mumbai 400076, India |
| |
Abstract: | In this paper we present a polynomial-time algorithm that finds paths of length Ω((logn/loglogn)2) in undirected Hamiltonian graphs, improving the previous best of Ω(logn). |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|