A polynomial time algorithm for longest paths in biconvex graphs
WALCOM（2011）
摘要
The longest path problem is the problem of finding a simple path of maximum length in a graph. Polynomial solutions for this problem are known only for special classes of graphs, while it is NP-hard on general graphs. In this paper we are proposing a O(n6) time algorithm to find the longest path on biconvex graphs, where n is the number of vertices of the input graph. We have used Dynamic Programming approach.
更多查看译文
关键词
special class,maximum length,general graph,biconvex graph,polynomial time algorithm,longest path problem,longest path,polynomial solution,dynamic programming approach,simple path,input graph,complexity,complex dynamics,dynamic programming
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要