Skip to main content
SpringerLink
Log in

An Experimental Evaluation of Treewidth at Most Four Reductions

  • Conference paper
Experimental Algorithms (SEA 2011)

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

Included in the following conference series:

Abstract

We analyze the computational effectiveness of the graph reductions proposed by Sanders [12,13] to recognize graphs of treewidth at most four. We show that graphs of treewidth at most four can be recognized extremely fast by this infinite set of reductions. For graphs of larger treewidth, however, the added value of the specific reductions for treewidth four fades away with the width.

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. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods 8, 277–284 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM Journal on Algebraic and Discrete Methods 7, 305–314 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bodlaender, H.L., Koster, A.M.C.A.: Safe separators for treewidth. Discrete Mathematics 306, 337–350 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Information and Computation 208, 259–275 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Technical Report UU-CS-2010-22, Dept. of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2010)

    Google Scholar 

  7. Bodlaender, H.L., Koster, A.M.C.A., van der Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence 21(3), 286–305 (2005)

    Article  MathSciNet  Google Scholar 

  8. Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica 29, 543–559 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. van der Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica 47, 138–158 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Hein, A.: Reduktionsregeln für baumweite 4. Bachelor’s thesis, Mathematik, RWTH Aachen University (2010), http://www.math2.rwth-aachen.de/koster

  11. Röhrig, H.: Tree decomposition: A feasibility study. Master’s thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany (1998)

    Google Scholar 

  12. Sanders, D.P.: Linear Algorithms for Graphs of Tree-Width at Most Four. PhD thesis, Georgia Institute of Technology (1993)

    Google Scholar 

  13. Sanders, D.P.: On linear recognition of tree-width at most four. SIAM Journal on Discrete Mathematics 9(1), 101–117 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, RWTH Aachen University, Germany

    Alexander Hein

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Wüllnerstr. 5b, D-52062, Aachen, Germany

    Arie M. C. A. Koster

Authors
  1. Alexander Hein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arie M. C. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  2. Division of Economics and Business, Colorado School of Mines, Engineering Hall 310, 816 15th Street, 80401, Golden, CO, USA

    Steffen Rebennack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hein, A., Koster, A.M.C.A. (2011). An Experimental Evaluation of Treewidth at Most Four Reductions. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20662-7_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20661-0

  • Online ISBN: 978-3-642-20662-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation