A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
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(n 6) 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.
KeywordsLongest path problem biconvex graphs polynomial algorithm complexity dynamic programming
Unable to display preview. Download preview PDF.
- 4.Nikolopoulos, S., Ioannidou, K.: The longest path problem is polynomial on cocomparability graphs. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 27–38. Springer, Heidelberg (2010)Google Scholar