# Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

@article{Cygan2011SolvingCP,
title={Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time},
author={Marek Cygan and Jesper Nederlof and Marcin Pilipczuk and Michal Pilipczuk and Johan M. M. van Rooij and J. Wojtaszczyk},
journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
year={2011},
pages={150-159}
}
• Marek Cygan, +3 authors J. Wojtaszczyk
• Published 2011
• Computer Science, Mathematics
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
For the vast majority of local problems on graphs of small tree width (where by local we mean that a solution can be verified by checking separately the neighbourhood of each vertex), standard dynamic programming techniques give c^tw |V|^O(1) time algorithms, where tw is the tree width of the input graph G = (V, E) and c is a constant. On the other hand, for problems with a global requirement (usually connectivity) the best -- known algorithms were naive dynamic programming schemes running in… Expand
333 Citations
Cut&Count technique for graph connectivity problems parameterized by treewidth
For the vast majority of local algorithmic problems on graphs of small treewidth (where by local we mean that a solution can be verified by checking the neighbourhood of each vertex separately),Expand
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
• Computer Science, Mathematics
• Inf. Comput.
• 2013
Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented. Expand
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
• Mathematics, Computer Science
• ArXiv
• 2012
Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c^{tw}|V|^{O(1)} time algorithms, also for weighted and counting versions of connectivity problems are presented. Expand
The role of planarity in connectivity problems parameterized by treewidth
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2015
For some years it was believed that for "connectivity" problems such as Hamiltonian Cycle, algorithms running in time 2 O ( tw ) ? n O ( 1 ) - called single-exponential - existed only on planar andExpand
The Role of Planarity in Connectivity Problems Parameterized by Treewidth
• Mathematics, Computer Science
• IPEC
• 2014
The role of planarity in connectivity problems parameterized by treewidth is investigated, and several problems can indeed be distinguished according to their behavior on planar graphs, and it is proved that Planar Cycle Packing and Planar Disjoint Paths cannot be solved in time. Expand
Cut and Count and Representative Sets on Branch Decompositions
• Computer Science, Mathematics
• IPEC
• 2016
This paper obtains the currently fastest randomised algorithms for several problems on planar graphs for Steiner Tree, Connected Dominating Set, Feedback Vertex Set and TSP, and a faster deterministic algorithm for TSP. Expand
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
• Computer Science, Mathematics
• ACM J. Exp. Algorithmics
• 2019
A thorough experimental evaluation of algorithms for connectivity problems that have only single-exponential dependency on the treewidth in the running time bound is performed in the context of one of the most classic connectivity problems, namely, HAMILTONIAN CYCLE. Expand
J un 2 01 8 Fast Dynamic Programming on Graph Decompositions ∗
In this paper, we consider three types of graph decompositions, namely tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programmingExpand
Computing the chromatic number using graph decompositions via matrix rank
• 2018
Computing the smallest number q such that the vertices of a given graph can be properly qcolored is one of the oldest and most fundamental problems in combinatorial optimization. The q-ColoringExpand
Coverability and Fast Sub-exponential Parameterized Algorithms in Planar Graphs ∗
We provide a new framework, alternative to bidimensionality, of sub-exponential parameterized algorithms on planar graphs, which is based on the notion of coverability. Roughly speaking, aExpand

#### References

SHOWING 1-10 OF 80 REFERENCES
On Two Techniques of Combining Branching and Treewidth
• Computer Science, Mathematics
• Algorithmica
• 2007
The efficiency of simple algorithms based on combinations of Branch & Reduce and dynamic programming on graphs of bounded treewidth are discussed and how similar techniques can be used to design faster parameterized algorithms are discussed. Expand
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
• Mathematics, Computer Science
• SWAT
• 2006
We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain timeExpand
A Simple and Fast Approach for Solving Problems on Planar Graphs
• Mathematics, Computer Science
• STACS
• 2004
This work introduces a new algorithm design paradigm for solving problems on planar graphs based on complicated combinatorial arguments that make strong use of results derived by the Graph Minors Theory and proves that branch-width of a planar graph is at most 2.122. Expand
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• Computer Science, Mathematics
• JACM
• 2011
It is shown that Steiner forest can be solved in polynomial time for series-parallel graphs (graphs of treewidth at most two) by a novel combination of dynamic programming and minimum cut computations, completing the thorough complexity study of Steiner Forest in the range of bounded-treewidth graphs, planar graphs, and bounded-genus graphs. Expand
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
• Mathematics, Computer Science
• ESA
• 2005
A new framework for designing fast subexponential exact and parameterized algorithms on planar graphs based on geometric properties of planar branch decompositions obtained by Seymour & Thomas, combined with new techniques of dynamic programming on planars based on properties of non-crossing partitions is presented. Expand
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
• Mathematics, Computer Science
• Algorithmica
• 2009
The approach is based on geometric properties of planar branch decompositions obtained by Seymour and Thomas, combined with refined techniques of dynamic programming on planar graphs based on properties of non-crossing partitions to design fast subexponential exact and parameterized algorithms onPlanar graphs. Expand
Combinatorial Optimization on Graphs of Bounded Treewidth
• Mathematics, Computer Science
• Comput. J.
• 2008
The concepts of treewidth and tree decompositions are introduced, and the technique with the Weighted Independent Set problem is illustrated, to survey some of the latest developments. Expand
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
• Mathematics, Computer Science
• ISAAC
• 2002
The main technical lemma is that that there exists a constant c such that, if an undirected graph on n vertices with minimum degree 3 has a feedback vertex set of size at most c?n, then the graph will have a cycle of length at most 12. Expand
Faster Algebraic Algorithms for Path and Packing Problems
• I. Koutis
• Mathematics, Computer Science
• ICALP
• 2008
New and faster algorithms for two well studied problems are presented, using poly(n) random bits, comparing to the 2O(k)random bits required in prior algorithms, while having similar low space requirements. Expand
FPT algorithms for Connected Feedback Vertex Set
• Mathematics, Computer Science
• J. Comb. Optim.
• 2012
It is shown that Connected Feedback Vertex Set can be solved in time O(2O(k)nO(1)) on general graphs and in time $O(2^{O(\sqrt{k}\log k)}n^{O( 1)})$ on graphs excluding a fixed graph H as a minor. Expand