Four Short Stories on Surprising Algorithmic Uses of Treewidth

Marx, Dániel

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

Four Short Stories on Surprising Algorithmic Uses of Treewidth

MPS-Authors

/persons/resource/persons250066

Marx, Dániel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:2008.07968.pdf
(Preprint), 573KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Marx, D. (2020). Four Short Stories on Surprising Algorithmic Uses of Treewidth. Retrieved from https://arxiv.org/abs/2008.07968.

Cite as: https://hdl.handle.net/21.11116/0000-0007-4950-D

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.