A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs

  • Esha Ghosh
  • N. S. Narayanaswamy
  • C. Pandu Rangan
Conference paper

DOI: 10.1007/978-3-642-19094-0_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6552)
Cite this paper as:
Ghosh E., Narayanaswamy N.S., Pandu Rangan C. (2011) A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. In: Katoh N., Kumar A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin, Heidelberg

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(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.

Keywords

Longest path problem biconvex graphs polynomial algorithm complexity dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Esha Ghosh
    • 1
  • N. S. Narayanaswamy
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Dept. of Computer Science and EngineeringIIT MadrasChennaiIndia

Personalised recommendations