Advertisement

A Unified Approach for the Longest Path Problem on Some Tree-Like Graphs

  • Ang-Lin Dong
  • Sheng-Lung PengEmail author
Conference paper
  • 718 Downloads
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 222)

Abstract

In a graph, a maximal biconnected component is called a block. A graph is called a block (resp., cactus and probe block) graph if its every block is a clique (resp., an edge or cycle, and complete split graph). In this paper, we propose a unified approach for the longest path problem on block, cactus, and probe block graphs. As a result, the longest path problem can be solved in linear time on block and probe block graphs, and in quadrat time on cactus graphs.

Keywords

Longest path problem Block graphs Cactus graphs Probe block graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    Bulterman, R., van der Sommen, F., Zwaan, G., Verhoeff, T., van Gasteren, A., Feijen, W.: On computing a longest path in a tree. Inf. Process. Lett. 81, 93–96 (2002)CrossRefGoogle Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: A guide to the theory of NP- completeness. Computers and Intractability, p. 338 (1979)Google Scholar
  3. 3.
    Ioannidou, K., Nikolopoulos, S.D.: The longest path problem is polynomial on cocomparability graphs. Algorithmica 65, 177–205 (2013)CrossRefGoogle Scholar
  4. 4.
    Ioannidou, K., Nikolopoulos, S.D., Mertzios, G.B.: The longest path problem has a polynomial solution on interval graphs. Algorithmica 61, 320–341 (2011)CrossRefGoogle Scholar
  5. 5.
    Le, V.B., Peng, S.-L.: Characterizing and recognizing probe block graphs. Theoretical Computer Science 568, 97–102 (2015)CrossRefGoogle Scholar
  6. 6.
    Markov, M., Andreica, M.I., Manev, K., Tapu, N.: A linear time algorithm for computing longest paths in cactus graphs. Serdica J. Computing 6, 287–298 (2012)Google Scholar
  7. 7.
    Mertzios, G.B., Bezakova, I.: Computing and counting longest paths on circular-arc graphs in polynomial time. Electronic Notes in Discrete Mathematics 37, 219–224 (2011)CrossRefGoogle Scholar
  8. 8.
    Takahara, Y., Teramoto, S., Uehara, R.: Longest path problems on ptolemaic graphs. IEICE Transactions on Information and Systems 91-D, 170–177 (2008)CrossRefGoogle Scholar
  9. 9.
    Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Int. J. Found. Comput. Sci. 18, 911–930 (2007)CrossRefGoogle Scholar
  10. 10.
    Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103, 71–77 (2007)CrossRefGoogle Scholar
  11. 11.
    West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Dong Hwa UniversityShoufengTaiwan, R.O.C.

Personalised recommendations