Four Shorts Stories on Surprising Algorithmic Uses of Treewidth

Marx, Dániel

doi:10.1007/978-3-030-42071-0_10

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2023

Publication Types

Select...

Preprint1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 75 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, every such problem is fixed-parameter tractable (FPT) when parameterized by treewidth. Furthermore, bounded-treewidth graphs appear in a wide variety of contexts, which makes treewidth-based algorithms a ubiquitous tool in algorithm design [5][6][7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth

Wlodarczyk

2023

Preprint

View full text Add to dashboard Cite

In Chordal/Interval Vertex Deletion we ask how many vertices one needs to remove from a graph to make it chordal (respectively: interval). We study these problems under the parameterization by treewidth (tw) of the input graph G. On the one hand, we present an algorithm for Chordal Vertex Deletion with running time 2^O(tw)*|V(G)|, improving upon the running time 2^O(tw^2)*|V(G)|^O(1) by Jansen, de Kroon, and Wlodarczyk (STOC'21). When a tree decomposition of width tw is given, then the base of the exponent equals 2^(omega-1)*3+1. Our algorithm is based on a novel link between chordal graphs and graphic matroids, which allows us to employ the framework of representative families. On the other hand, we prove that the known 2^O(tw log tw)*|V(G)|-time algorithm for Interval Vertex Deletion cannot be improved assuming Exponential Time Hypothesis.

show abstract