Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2009: Algorithms - ESA 2009 pp 706–717Cite as

Contraction Bidimensionality: The Accurate Picture

  • Conference paper

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

Abstract

We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we unify and significantly simplify contraction bidimensionality theory—the meta algorithmic framework to design efficient parameterized and approximation algorithms for contraction closed parameters.

The research of the first two authors was supported by the Norwegian Research Council. The research of the third author was Supported by the project “Kapodistrias” (AΠ 02839/28.07.2008) of the National and Kapodistrian University of Athens (project code: 70/4/8757).

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270–279. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  2. Demaine, E., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal 51, 292–302 (2007)

    Article  Google Scholar 

  3. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discrete Math. 18, 501–511 (2004/2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52, 866–893 (2005)

    Google Scholar 

  5. Demaine, E.D., Hajiaghayi, M.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28, 19–36 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS 2005, pp. 637–646. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  7. Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Improved grid minor bounds and Wagner’s contraction. Algorithmica (to appear, 2009)

    Google Scholar 

  8. Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: The bidimensional theory of bounded-genus graphs. SIAM J. Discrete Math. 20, 357–371 (2006) (electronic)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comp. Sci. Rev. 2, 29–39 (2008)

    Article  MATH  Google Scholar 

  10. Geelen, J.F., Richter, R.B., Salazar, G.: Embedding grids in surfaces. European J. Combin. 25, 785–792 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mohar, B.: Combinatorial local planarity and the width of graph embeddings. Canad. J. Math. 44, 1272–1288 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins University Press, Baltimore (2001)

    MATH  Google Scholar 

  13. Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323–348 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Robertson, N., Seymour, P.D.: Disjoint paths—a survey. SIAM J. Algebraic Discrete Methods 6, 300–305 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Series B 41, 92–114 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  16. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153–190 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  17. Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89, 43–76 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323–348 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. Thomassen, C.: A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B 70, 306–311 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin & Petr Golovach

  2. Department of Mathematics, University of Athens, Panepistimioupolis, GR15784, Athens, Greece

    Dimitrios M. Thilikos

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dimitrios M. Thilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Amos Fiat

  2. Fakultät für Informatik, Universität Karlsruhe (TH), Am Fasanengarten 5, 76131, Karlsruhe, Germany

    Peter Sanders

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F.V., Golovach, P., Thilikos, D.M. (2009). Contraction Bidimensionality: The Accurate Picture. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04128-0_63

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation