arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.2503cs.DS
收藏

无向图中最长路问题的贪婪近似算法

A greedy approximation algorithm for the longest path problem in undirected graphs

Lajos L. Pongrácz

摘要:

在图论中,最长路径问题是在给定的图中找到最大长度的简单路径的问题。对于某些小类图,问题可以在多项式时间内解决[2,4],但对于一般图,它仍然是NP-难的,因为它包括Hamilton路问题作为特殊情况[3]。为了寻找一个简单、快速的算法来求解大型图中的长路径,本文给出了一个贪心算法,其时间复杂度为O(n^2(n+m)),其中n是顶点数,m是边数.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑