Skip to main content
SpringerLink
Log in

Graph Separators: A Parameterized View

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2108))

Included in the following conference series:

Abstract

Graph separation is a well-known tool to make (hard) graph problems accessible for a divide and conquer approach. We show how to use graph separator theorems in order to develop fixed parameter algorithms for many well-known NP-hard (planar) graph problems. We coin the key notion of glueable select&verify graph problems and derive from that a prospective way to easily check whether a planar graph problem will allow for a fixed parameter divide and conquer algorithm of running time c \( ^{\sqrt k } \) · n O(1) for a constant c.

Full version: Technical Report No. WSI-2001-8, Universität Tübingen (Fed. Rep. of Germany), Wilhelm-Schickard-Institut für Informatik.

Supported by the Deutsche Forschungsgemeinschaft (research project PEAL (Parameterized complexity and Exact ALgorithms), NI 369/1-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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Alber, H.L. Bodlaender, H. Fernau, and R. Niedermeier Fixed parameter algorithms for planar dominating set and related problems. In Proc. 7th SWAT, vol. 1851 of LNCS, Springer, pp. 97–110, 2000.

    Google Scholar 

  2. J. Alber, H. Fernau, and R. Niedermeier Parameterized complexity: exponential speed-up for planar graph problems. Technical Report TR01-023, ECCC Reports, Trier, March 2001. Extended abstract in Proc. 28th ICALP, Springer, 2001.

    Google Scholar 

  3. L. Cai and D. Juedes Subexponential parameterized algorithms collapse the Whierarchy. In Proc. 28th ICALP, Springer, 2001.

    Google Scholar 

  4. J. Chen, I. Kanj, and W. Jia Vertex cover: Further observations and further improvements. In Proc. 25th WG, vol. 1665 of LNCS, Springer, pp. 313–324, 1999.

    Google Scholar 

  5. H.N. Djidjev A separator theorem for graphs of fixed genus. Serdica, 11:319–329, 1985.

    MATH  MathSciNet  Google Scholar 

  6. H.N. Djidjev and S. Venkatesan Reduced constants for simple cycle graph separation. Acta Informatica, 34:231–243, 1997.

    Article  MathSciNet  Google Scholar 

  7. R.G. Downey and M.R. Fellows Parameterized Complexity. Springer, 1999.

    Google Scholar 

  8. R.J. Lipton and R.E. Tarjan A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177–189, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  9. R.J. Lipton and R.E. Tarjan Applications of a planar separator theorem. SIAM J. Comput., 9(3):615–627, 1980.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Fed. Rep. of Germany

    Jochen Alber, Henning Fernau & Rolf Niedermeier

Authors
  1. Jochen Alber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Massachusetts, One University Avenue, Lowell, MA, 01854, USA

    Jie Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alber, J., Fernau, H., Niedermeier, R. (2001). Graph Separators: A Parameterized View. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-44679-6_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42494-9

  • Online ISBN: 978-3-540-44679-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation