A greedy approximation algorithm for the longest path problem in undirected graphs
Data Structures and Algorithms
2014-09-15 v3
Abstract
In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general graphs, since it includes the Hamiltonian path problem as a special case [3]. Motivated by finding a simple, quick algorithm for finding long paths in large graphs, in this paper we show a greedy algorithm with a time complexity of O(n^2 (n+m)), where n is the number of the vertices and m is the number of edges.
Cite
@article{arxiv.1209.2503,
title = {A greedy approximation algorithm for the longest path problem in undirected graphs},
author = {Lajos L. Pongrácz},
journal= {arXiv preprint arXiv:1209.2503},
year = {2014}
}
Comments
6 pages, 3 figures Withdrawn due to an error in search subroutine, 2nd figure and time complexity