Skip to main content
SpringerLink
Log in

Contracting a Chordal Graph to a Split Graph or a Tree

  • Conference paper
Mathematical Foundations of Computer Science 2011 (MFCS 2011)

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

Abstract

The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a contraction or as an induced minor, respectively. We show that these two problems can be solved in \(|V_G|^{f(|V_H|)}\) time if G is a chordal input graph and H is a split graph or a tree. In contrast, we show that containment relations extending Subgraph Isomorphism can be solved in linear time if G is a chordal input graph and H is an arbitrary graph not part of the input.

This work is supported by EPSRC (EP/G043434/1).

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. Belmonte, R., Heggernes, P., van ’t Hof, P.: Edge contractions in subclasses of chordal graphs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 528–539. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM Journal on Computing 10, 751–771 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. Graph Theory and Sparse Matrix Computation 56, 1–29 (1993)

    MathSciNet  Google Scholar 

  4. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)

    Google Scholar 

  5. Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. Journal of Graph Theory 11, 71–79 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Diestel, R.: Graph Theory, Electronic edn. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  8. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141, 109–131 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fellows, M.R., Kratochvíl, J., Middendorf, M., Pfeiffer, F.: The Complexity of Induced Minors and Related Problems. Algorithmica 13, 266–282 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Foldes, S., Hammer, P.L.: Split graphs. In: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), Congressus Numerantium, vol. (XIX), Utilitas Math., Winnipeg, Man, pp. 311–315 (1977)

    Google Scholar 

  11. Galinier, P., Habib, M., Paul, C.: Chordal Graphs and Their Clique Graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358–371. Springer, Heidelberg (1995)

    Google Scholar 

  12. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B 16, 47–56 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  13. Golovach, P.A., Kaminski, M., Paulusma, D., Thilikos, D.M.: Containment relations in split graphs (manuscript)

    Google Scholar 

  14. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics 57 (2004)

    Google Scholar 

  15. Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. To appear in Symposium on Theory of Computing, STOC 2011 (2011)

    Google Scholar 

  16. Heggernes, P., van ’t Hof, P., Lévěque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. In: Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, Electronic Notes in Discrete Mathematics (to appear, 2011)

    Google Scholar 

  17. van ’t Hof, P., Kamiński, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Applied Mathematics (to appear)

    Google Scholar 

  18. Kamiński, M., Paulusma, D., Thilikos, D.M.: Contractions of planar graphs in polynomial time. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 122–133. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Levin, A., Paulusma, D., Woeginger, G.J.: The computational complexity of graph contractions I: polynomially solvable and NP-complete cases. Networks 51, 178–189 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Levin, A., Paulusma, D., Woeginger, G.J.: The computational complexity of graph contractions II: two tough polynomially solvable cases. Networks 52, 32–56 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  21. Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics 108, 343–364 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  23. Okamoto, Y., Takeaki, U., Uehara, R.: Counting the number of independent sets in chordal graphs. Journal of Discrete Algorithms 6, 229–242 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63, 65–110 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Computing Sciences, Durham University, Science Laboratories, South Road, Durham, DH1 3LE, United Kingdom

    Petr A. Golovach & Daniël Paulusma

  2. Département d’Informatique, Université Libre de Bruxelles, Belgium

    Marcin Kamiński

Authors
  1. Petr A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Kamiński
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniël Paulusma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Filip Murlak  & Piotr Sankowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Golovach, P.A., Kamiński, M., Paulusma, D. (2011). Contracting a Chordal Graph to a Split Graph or a Tree. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22993-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation