Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms and Computation

WALCOM 2011: WALCOM: Algorithms and Computation pp 191–201Cite as

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6552))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbas, N., Stewart, L.K.: Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics 103(1-3), 1–19 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Rao Arikati, S., Pandu Rangan, C.: Linear algorithm for optimal path cover problem on interval graphs. Inf. Process. Lett. 35(3), 149–153 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM, Philadelphia (1999)

    Book  MATH  Google Scholar 

  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 

  5. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., Amsterdam (2004)

    MATH  Google Scholar 

  6. Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem is polynomial on interval graphs. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 403–414. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18(3), 279–292 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  8. Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871–883. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Int. J. Found. Comput. Sci. 18(5), 911–930 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2), 71–77 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India

    Esha Ghosh, N. S. Narayanaswamy & C. Pandu Rangan

Authors
  1. Esha Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. S. Narayanaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  2. Department of Computer Science and Engineering, Hauz Khas, Indian Institute of Technology, 11016, New Delhi, India

    Amit Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-19094-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19094-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19093-3

  • Online ISBN: 978-3-642-19094-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation