Skip to main content
SpringerLink
Log in

Induced Subtrees in Interval Graphs

  • Conference paper
Combinatorial Algorithms (IWOCA 2013)

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

Included in the following conference series:

Abstract

The Induced Subtree Isomorphism problem takes as input a graph G and a tree T, and the task is to decide whether G has an induced subgraph that is isomorphic to T. This problem is known to be NP-complete on bipartite graphs, but it can be solved in polynomial time when G is a forest. We show that Induced Subtree Isomorphism can be solved in polynomial time when G is an interval graph. In contrast to this positive result, we show that the closely related Subtree Isomorphism problem is NP-complete even when G is restricted to the class of proper interval graphs, a well-known subclass of interval graphs.

This work is supported by the Research Council of Norway, by the Slovenian Research Agency, and by the European Science Foundation.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, R.K.: An investigation of the subgraph isomorphism problem. M.Sc. Thesis, Dept. of Computer Science, University of Toronto, TR 138180 (1980)

    Google Scholar 

  2. Belmonte, R., Heggernes, P., van ’t Hof, P.: Edge contractions in subclasses of chordal graphs. Discrete Appl. Math. 160, 999–1010 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM, Philadelphia (1999)

    Google Scholar 

  4. Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discrete Math. 12, 276–287 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete App. Math. 3, 163–174 (1981)

    Article  MATH  Google Scholar 

  6. Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10, 399–430 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Damaschke, P.: Induced subgraph isomorphism for cographs is NP-complete. In: Proceedings WG 1991. LNCS, vol. 484, pp. 72–78. Springer (1991)

    Google Scholar 

  8. Diestel, R.: Graph Theory. Electronic Edition (2005)

    Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman & Co. (1979)

    Google Scholar 

  10. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing 1, 180–187 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  11. Golovach, P.A., Kamiński, M., Paulusma, D., Thilikos, D.M.: Containment relations in split graphs. Discrete Appl. Math. 160, 155–163 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol. 57. North Holland (2004)

    Google Scholar 

  13. Heggernes, P.: van ’t Hof, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on proper interval and bipartite permutation graphs (submitted)

    Google Scholar 

  14. Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem has a polynomial solution on interval graphs. Algorithmica 61, 320–341 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ishizeki, T., Otachi, Y., Yamazaki, K.: An improved algorithm for the longest induced path problem on k-chordal graphs. Discrete Appl. Math. 156, 3057–3059 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kijima, S., Otachi, Y., Saitoh, T., Uno, T.: Subgraph isomorphism in graph classes. Discrete Math. 312, 3164–3173 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99, 111–123 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kratsch, D., Müller, H., Todinca, I.: Feedback vertex set and longest induced path on AT-free graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 309–321. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Krishnamoorthy, M.S.: An NP-hard problem in bipartite graphs. ACM SIGACT News 7(1), 26 (1975)

    Article  MathSciNet  Google Scholar 

  20. Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51, 45–64 (1962)

    MathSciNet  MATH  Google Scholar 

  21. Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Computers Math. Applic. 25, 15–25 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Matousek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Math. 108, 343–364 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  23. Matula, D.W.: An algorithm for subtree identification. SIAM Rev. 10, 273–274 (1968)

    Google Scholar 

  24. Mertzios, G.B., Corneil, D.G.: A simple polynomial algorithm for the longest path problem on cocomparability graphs. SIAM J. Discrete Math. 26, 940–963 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Alg. Discr. Meth. 7, 505–512 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Müller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291–298 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  27. Olariu, S.: An optimal greedy heuristic to color interval graphs. Inform. Proc. Lett. 37, 21–25 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Norway

    Pinar Heggernes & Pim van ’t Hof

  2. UP IAM and UP FAMNIT, University of Primorska, Slovenia

    Martin Milanič

Authors
  1. Pinar Heggernes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pim van ’t Hof
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Milanič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, LITIS, Université de Rouen, 76821, EA 4180, Mont Saint Aignan Cedex, France

    Thierry Lecroq  & Laurent Mouchard  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heggernes, P., van ’t Hof, P., Milanič, M. (2013). Induced Subtrees in Interval Graphs. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45278-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45277-2

  • Online ISBN: 978-3-642-45278-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation