Skip to main content
SpringerLink
Log in

Kernelization, Preprocessing for Treewidth

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 43 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Arnborg S, Corneil DG, Proskurowski A (1987) Complexity of finding embeddings in a k-tree. SIAM J Algebra Discret 8(2):277–284. doi:10.1137/0608024

    Article  MathSciNet  MATH  Google Scholar 

  2. Bodlaender HL (1996) A linear-time algorithm for finding tree-decom-positions of small treewidth. SIAM J Comput 25(6):1305–1317. doi:10.1145/167088.167161

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender HL, Koster AMCA (2006) Safe separators for treewidth. Discret Math 306(3): 337–350. doi:10.1016/j.disc.2005.12.017

    Article  MathSciNet  MATH  Google Scholar 

  4. Bodlaender HL, Möhring RH (1993) The pathwidth and treewidth of cographs. SIAM J Discret Math 6(2):181–188. doi:10.1137/0406014

    Article  MathSciNet  MATH  Google Scholar 

  5. Bodlaender HL, Koster AMCA, van den Eijkhof F (2005) Preprocessing rules for triangulation of probabilistic networks. Comput Intell 21(3):286–305. doi:10.1111/j.1467-8640.2005.00274.x

    Article  MathSciNet  Google Scholar 

  6. Bodlaender HL, Downey RG, Fellows MR, Hermelin D (2009) On problems without polynomial kernels. J Comput Syst Sci 75(8):423–434

    Article  MathSciNet  MATH  Google Scholar 

  7. Bodlaender HL, Jansen BMP, Kratsch S (2013) Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J Discret Math 27(4):2108–2142

    Article  MathSciNet  MATH  Google Scholar 

  8. Bodlaender HL, Jansen BMP, Kratsch S (2014) Kernelization lower bounds by cross-composition. SIAM J Discret Math 28(1):277–305

    Article  MathSciNet  MATH  Google Scholar 

  9. Drucker A (2012) New limits to classical and quantum instance compression. In: FOCS, New Brunswick. IEEE Computer Society, pp 609–618

    Google Scholar 

  10. Fortnow L, Santhanam R (2011) Infeasibility of instance compression and succinct PCPs for NP. J Comput Syst Sci 77(1):91–106

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering and Theoretical Computer Science, Technical University Berlin, Berlin, Germany

    Stefan Kratsch

Authors
  1. Stefan Kratsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Kratsch, S. (2016). Kernelization, Preprocessing for Treewidth. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_529

Download citation

Publish with us

Policies and ethics

Search

Navigation