Abstract
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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Ghosh, E., Narayanaswamy, N. S., & Pandu Rangan, C. (2011). A polynomial time algorithm for longest paths in biconvex graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6552 LNCS, pp. 191–201). https://doi.org/10.1007/978-3-642-19094-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
