Skip to main content
SpringerLink
Log in

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth

  • Chapter
  • First Online:
Treewidth, Kernels, and Algorithms

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

Abstract

This article briefly describes four algorithmic problems where the notion of treewidth is very useful. Even though the problems themselves have nothing to do with treewidth, it turns out that combining known results on treewidth allows us to easily describe very clean and high-level algorithms.

This research is a part of a project that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement SYSTEMATICGRAPH (No. 725978).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Notes

  1. 1.

    Marcus and Tardos [61] mentions that the conjecture was formulated around 1992 (but it is hard to find a citable source) and the PhD thesis of Julian West is an even earlier source [75].

References

  1. Aboulker, P., Brettell, N., Havet, F., Marx, D., Trotignon, N.: Coloring graphs with constraints on connectivity. J. Graph Theory 85(4), 814–838 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discret. Math. 22(2), 629–649 (2008). https://doi.org/10.1137/S0895480104444776

    Article  MathSciNet  MATH  Google Scholar 

  3. Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Holton, D.A.: Algorithms for pattern involvement in permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 355–367. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45678-3_31. http://dl.acm.org/citation.cfm?id=646344.689586

    Chapter  MATH  Google Scholar 

  4. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995). https://doi.org/10.1145/210332.210337

    Article  MathSciNet  MATH  Google Scholar 

  5. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, 17–19 January 1999, pp. 856–857 (1999). http://dl.acm.org/citation.cfm?id=314500.314969

  6. Berendsohn, B.A., Kozma, L., Marx, D.: Finding and counting permutations via CSPs, accepted to IPEC (2019)

    Google Scholar 

  7. Bertelè, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theory Ser. A 14(2), 137–148 (1973). https://doi.org/10.1016/0097-3165(73)90016-2

    Article  MathSciNet  MATH  Google Scholar 

  8. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Counting paths and packings in halves. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 578–586. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04128-0_52

    Chapter  Google Scholar 

  9. Björklund, A., Kaski, P., Kowalik, L.: Counting thin subgraphs via packings faster than meet-in-the-middle time. In: Proceedings of the 25th Annual Symposium on Discrete Algorithms (SODA), pp. 594–603 (2014). https://doi.org/10.1137/1.9781611973402.45

  10. Bliznets, I., Fomin, F.V., Pilipczuk, M., Villanger, Y.: Largest chordal andinterval subgraphs faster than \(2^n\). Algorithmica 76(2), 569–594 (2016). https://doi.org/10.1007/s00453-015-0054-2

    Article  MathSciNet  MATH  Google Scholar 

  11. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015). https://doi.org/10.1016/j.ic.2014.12.008

    Article  MathSciNet  MATH  Google Scholar 

  12. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A \(c^k\cdot n\) 5-approximation algorithm for treewidth. SIAMJ. Comput. 45(2), 317–378 (2016). https://doi.org/10.1137/130947374

    Article  MATH  Google Scholar 

  13. Bodlaender, H.L., Lokshtanov, D., Penninkx, E.: Planar capacitated dominating set is W[1]-Hard. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 50–60. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-11269-0_4

    Chapter  Google Scholar 

  14. Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. PVLDB 11(2), 149–161 (2017). https://doi.org/10.14778/3149193.3149196. http://www.vldb.org/pvldb/vol11/p149-bonifati.pdf

    Article  Google Scholar 

  15. Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Counting graph homomorphisms. Top. Discret. Math. 26, 315–371 (2006). https://doi.org/10.1007/3-540-33700-8_18

    Article  MathSciNet  MATH  Google Scholar 

  16. Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277–283 (1998). https://doi.org/10.1016/S0020-0190(97)00209-3

    Article  MathSciNet  MATH  Google Scholar 

  17. Bourgeois, N., Escoffier, B., Paschos, V.T.: An O*(1.0977n) exact algorithm for max independent set in sparse graphs. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 55–65. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79723-4_7

    Chapter  MATH  Google Scholar 

  18. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast algorithmsfor max independent set. Algorithmica 62(1–2), 382–415 (2012). https://doi.org/10.1007/s00453-010-9460-7

    Article  MathSciNet  MATH  Google Scholar 

  19. Cai, L., Fellows, M.R., Juedes, D.W., Rosamond, F.A.: The complexity of polynomial-time approximation. Theory Comput. Syst. 41(3), 459–477 (2007). https://doi.org/10.1007/s00224-007-1346-y

    Article  MathSciNet  MATH  Google Scholar 

  20. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: Improved upper bounds for np-hard problems. Algorithmica 43(4), 245–273 (2005). https://doi.org/10.1007/s00453-004-1145-7

    Article  MathSciNet  MATH  Google Scholar 

  21. Curticapean, R.: Counting matchings of size k Is \(\sharp \)W[1]-Hard. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 352–363. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39206-1_30

    Chapter  Google Scholar 

  22. Curticapean, R., Dell, H., Marx, D.: Homomorphisms are a good basis for counting small subgraphs. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19–23 June 2017, pp. 210–223 (2017). https://doi.org/10.1145/3055399.3055502

  23. Curticapean, R., Marx, D.: Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18–21 October 2014, pp. 130–139 (2014). https://doi.org/10.1109/FOCS.2014.22

  24. Cygan, M., Kowalik, L., Socala, A.: Improving TSP tours using dynamic programming over tree decompositions. In: 25th Annual European Symposium on Algorithms, ESA 2017, 4–6 September 2017, Vienna, Austria, pp. 30:1–30:14 (2017). https://doi.org/10.4230/LIPIcs.ESA.2017.30

  25. Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22–25 October 2011, pp. 150–159. IEEE Computer Society (2011). https://doi.org/10.1109/FOCS.2011.23

  26. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Solving the 2-disjoint connected subgraphs problem faster than 2 n. Algorithmica 70(2), 195–207 (2014). https://doi.org/10.1007/s00453-013-9796-x

    Article  MathSciNet  MATH  Google Scholar 

  27. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell. 38(3), 353–366 (1989). https://doi.org/10.1016/0004-3702(89)90037-4. http://www.sciencedirect.com/science/article/pii/0004370289900374

    Article  MathSciNet  MATH  Google Scholar 

  28. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501–511 (2004). https://doi.org/10.1137/S0895480103433410

    Article  MathSciNet  MATH  Google Scholar 

  29. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Fixed-parameteralgorithms for (\(k\), \(r\))-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33–47 (2005). https://doi.org/10.1145/1077464.1077468

    Article  MathSciNet  MATH  Google Scholar 

  30. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-freegraphs. J. ACM 52(6), 866–893 (2005). https://doi.org/10.1145/1101821.1101823

    Article  MathSciNet  MATH  Google Scholar 

  31. Demaine, E.D., Hajiaghayi, M.T., Thilikos, D.M.: Exponential speedup offixed-parameter algorithms for classes of graphs excluding single-crossinggraphs as minors. Algorithmica 41(4), 245–267 (2005). https://doi.org/10.1007/s00453-004-1125-y

    Article  MathSciNet  MATH  Google Scholar 

  32. Díaz, J., Serna, M.J., Thilikos, D.M.: Counting H-colorings of partial k-trees. Theor. Comput. Sci. 281(1–2), 291–309 (2002). https://doi.org/10.1016/S0304-3975(02)00017-8

    Article  MathSciNet  MATH  Google Scholar 

  33. Dorn, F.: Dynamic programming and planarity: Improved tree-decomposition basedalgorithms. Discret. Appl. Math. 158(7), 800–808 (2010). https://doi.org/10.1016/j.dam.2009.10.011

    Article  MATH  Google Scholar 

  34. Dorn, F.: Planar subgraph isomorphism revisited. In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, 4–6 March 2010, Nancy, France, pp. 263–274 (2010). https://doi.org/10.4230/LIPIcs.STACS.2010.2460

  35. Dorn, F., Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Inf. Comput. 233, 60–70 (2013). https://doi.org/10.1016/j.ic.2013.11.006

    Article  MathSciNet  MATH  Google Scholar 

  36. Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming in h-minor-free graphs. J. Comput. Syst. Sci. 78(5), 1606–1622 (2012). https://doi.org/10.1016/j.jcss.2012.02.004

    Article  MathSciNet  MATH  Google Scholar 

  37. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica 58(3), 790–810 (2010). https://doi.org/10.1007/s00453-009-9296-1

    Article  MathSciNet  MATH  Google Scholar 

  38. Fischl, W., Gottlob, G., Longo, D.M., Pichler, R.: Hyperbench: a benchmark and tool for hypergraphs and empirical findings. In: Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunción, Paraguay, 3–7 June 2019 (2019). http://ceur-ws.org/Vol-2369/short02.pdf

  39. Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput. 33(4), 892–922 (2004). https://doi.org/10.1137/S0097539703427203

    Article  MathSciNet  MATH  Google Scholar 

  40. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques ofcombining branching and treewidth. Algorithmica 54(2), 181–207 (2009). https://doi.org/10.1007/s00453-007-9133-3

    Article  MathSciNet  MATH  Google Scholar 

  41. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1–25:32 (2009). https://doi.org/10.1145/1552285.1552286

    Article  MathSciNet  MATH  Google Scholar 

  42. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5), 191–196 (2006). https://doi.org/10.1016/j.ipl.2005.10.012

    Article  MathSciNet  MATH  Google Scholar 

  43. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16533-7

    Book  MATH  Google Scholar 

  44. Fomin, F.V., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. In: FOCS 2016, pp. 515–524. IEEE Computer Society (2016)

    Google Scholar 

  45. Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1–29:60 (2016). https://doi.org/10.1145/2886094

    Article  MathSciNet  MATH  Google Scholar 

  46. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width andexponential speed-up. SIAM J. Comput. 36(2), 281–309 (2006). https://doi.org/10.1137/S0097539702419649

    Article  MathSciNet  MATH  Google Scholar 

  47. Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: Proceedings of the Eighth National Conference on Artificial Intelligence, AAAI 1990, vol. 1, pp. 4–9. AAAI Press (1990), http://dl.acm.org/citation.cfm?id=1865499.1865500

  48. Gu, Q., Tamaki, H.: Improved bounds on the planar branchwidth with respect tothe largest grid minor size. Algorithmica 64(3), 416–453 (2012). https://doi.org/10.1007/s00453-012-9627-5

    Article  MathSciNet  MATH  Google Scholar 

  49. Guillemot, S., Marx, D.: Finding small patterns in permutations in linear time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5–7 January 2014, pp. 82–101 (2014). https://doi.org/10.1137/1.9781611973402.7

  50. Halin, R.: S-functions for graphs. J. Geom. 8(1–2), 171–186 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  51. Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  52. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  53. Jian, T.: \(O(2^{0.304n})\) algorithm for solving maximum independent set problem. IEEE Trans. Comput. 35(9), 847–851 (1986). https://www.scopus.com/inward/record.uri?eid=2-s2.0-0022787854&partnerID=40&md5=c723ea6d9074acfa3d6f6c73e3439007

    Article  MATH  Google Scholar 

  54. Klein, P.N., Marx, D.: A subexponential parameterized algorithm for subset TSP on planar graphs. In: SODA 2014, pp. 1812–1830. SIAM (2014)

    Google Scholar 

  55. Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, 15–17 December 2009, IIT Kanpur, India, pp. 287–298 (2009). https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2326

  56. Knuth, D.E.: The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley, Boston (1968)

    MATH  Google Scholar 

  57. Koutis, I., Williams, R.: LIMITS and applications of group algebras for parameterized problems. ACM Trans. Algorithms 12(3), 31:1–31:18 (2016). https://doi.org/10.1145/2885499

    Article  MathSciNet  MATH  Google Scholar 

  58. Lokshtanov, D., Saurabh, S., Wahlström, M.: Subexponential parameterized odd cycle transversal on planar graphs. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 424–434. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

    Google Scholar 

  59. Lovász, L.: Operations with structures. Acta Math. Hungarica 18(3–4), 321–328 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  60. Maniu, S., Senellart, P., Jog, S.: An experimental study of the treewidth of real-world graph data. In: 22nd International Conference on Database Theory, ICDT 2019, 26–28 March 2019, Lisbon, Portugal, pp. 12:1–12:18 (2019). https://doi.org/10.4230/LIPIcs.ICDT.2019.12

  61. Marcus, A., Tardos, G.: Excluded permutation matrices and the Stanley-Wilf conjecture. J. Comb. Theory Ser. A 107(1), 153–160 (2004). https://doi.org/10.1016/j.jcta.2004.04.002

    Article  MathSciNet  MATH  Google Scholar 

  62. Monien, B., Preis, R.: Upper bounds on the bisection width of 3- and 4-regular graphs. In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, 27–31 August 2001, Proceedings, pp. 524–536 (2001). https://doi.org/10.1007/3-540-44683-4_46

  63. Pilipczuk, M.: Surprising applications of treewidth bounds for planar graphs. In: Fomin, F.V., et al. (eds.) Bodlaender Festschrift. LNCS, vol. 12160, pp. 173–188. Springer, Heidelberg (2020). https://doi.org/10.1007/978-3-030-42071-0_13

  64. Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Subexponential-time parameterized algorithm for Steiner tree on planar graphs. In: STACS 2013. LIPIcs, vol. 20, pp. 353–364. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

    Google Scholar 

  65. Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Network sparsification for steiner problems on planar and bounded-genus graphs. In: FOCS 2014, pp. 276–285. IEEE Computer Society (2014)

    Google Scholar 

  66. Razgon, I.: Computing minimum directed feedback vertex set in \({O}(1.9977^n)\). In: Proceedings on Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, 3–5 October 2007, pp. 70–81 (2007)

    Google Scholar 

  67. Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. Discret. Algorithms 7(2), 191–212 (2009). https://doi.org/10.1016/j.jda.2008.09.004

    Article  MathSciNet  MATH  Google Scholar 

  68. Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62(2), 323–348 (1994). https://doi.org/10.1006/jctb.1994.1073

    Article  MathSciNet  MATH  Google Scholar 

  69. Robertson, N., Seymour, P.D.: Graph minors. III. planar tree-width. J. Comb. Theory Ser. B 36(1), 49–64 (1984). https://doi.org/10.1016/0095-8956(84)90013-3

    Article  MathSciNet  MATH  Google Scholar 

  70. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7(3), 425–440 (1986). https://doi.org/10.1016/0196-6774(86)90032-5

    Article  MathSciNet  MATH  Google Scholar 

  71. Scott, A.D., Sorkin, G.B.: Linear-programming design and analysis of fast algorithms for Max 2-CSP. Discret. Optim. 4(3–4), 260–287 (2007). https://doi.org/10.1016/j.disopt.2007.08.001

    Article  MathSciNet  MATH  Google Scholar 

  72. Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537–546 (1977). https://doi.org/10.1137/0206038

    Article  MathSciNet  MATH  Google Scholar 

  73. Thorup, M.: All structured programs have small tree-width and good register allocation. Inf. Comput. 142(2), 159–181 (1998). https://doi.org/10.1006/inco.1997.2697

    Article  MathSciNet  MATH  Google Scholar 

  74. Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189–201 (1979). https://doi.org/10.1016/0304-3975(79)90044-6

    Article  MathSciNet  MATH  Google Scholar 

  75. West, J.: Permutations with restricted subsequences and stack-sortable permutations. Ph.D. thesis, MIT, Cambridge, MA (1990)

    Google Scholar 

  76. Xiao, M., Nagamochi, H.: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469, 92–104 (2013). https://doi.org/10.1016/j.tcs.2012.09.022

    Article  MathSciNet  MATH  Google Scholar 

  77. Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Inf. Comput. 255, 126–146 (2017). https://doi.org/10.1016/j.ic.2017.06.001

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany

    Dániel Marx

Authors
  1. Dániel Marx
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dániel Marx .

Editor information

Editors and Affiliations

  1. University of Bergen, Bergen, Norway

    Fedor V. Fomin

  2. Humboldt-University, Berlin, Germany

    Stefan Kratsch

  3. Utrecht University, Utrecht, The Netherlands

    Erik Jan van Leeuwen

Additional information

Dedicated to Hans L. Bodlaender on the occasion of his 60th birthday.

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Marx, D. (2020). Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds) Treewidth, Kernels, and Algorithms. Lecture Notes in Computer Science(), vol 12160. Springer, Cham. https://doi.org/10.1007/978-3-030-42071-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42071-0_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42070-3

  • Online ISBN: 978-3-030-42071-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation