A Faster Parameterized Algorithm for Treedepth
Felix Reidl,Peter Rossmanith,Fernando Sánchez Villaamil,Somnath Sikdar +3 more
- pp 931-942
Reads0
Chats0
TLDR
In this paper, an n-vertex graph, a tree decomposition of width w, and an integer t are used to decide whether the input graph has treedepth at most t in time 2 O(wt) ·n.Abstract:
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. We present an algorithm which—given as input an n-vertex graph, a tree decomposition of width w, and an integer t—decides whether the input graph has treedepth at most t in time 2 O(wt) ·n. We use this to construct further algorithms which do not require a tree decomposition as part of their input: A simple algorithm which decides treedepth in linear time for a fixed t, thus answering an open question posed by Ossona de Mendez and Nesetřil as to whether such an algorithm exists, a fast algorithm with running time \(2^{O(t^2)} \cdot n\) and an algorithm for chordal graphs with running time 2 O(t logt)·n.read more
Citations
More filters
Posted Content
An Algorithmic Theory of Integer Programming
Friedrich Eisenbrand,Christoph Hunkenschröder,Kim-Manuel Klein,Martin Koutecký,Asaf Levin,Shmuel Onn +5 more
TL;DR: It is shown that integer programming can be solved in time, and a strongly-polynomial algorithm is derived, that is, with running time $g(a,d)\textrm{poly}(n)$, independent of the rest of the input data.
Posted Content
Uniform Kernelization Complexity of Hitting Forbidden Minors
TL;DR: It is proved that some Planar F-Minor-Free Deletion problems do not have uniformly polynomial kernels (unless NP ⊆ coNP/poly), not even when parameterized by the vertex cover number.
Structural sparseness and complex networks
TL;DR: It is stated that the theory of structurally sparse graphs is applicable to complex networks and, as a corollary, so is the rich algorithmic toolkit it provides and several fundamental network models exhibit these properties.
Journal ArticleDOI
Uniform Kernelization Complexity of Hitting Forbidden Minors
TL;DR: In this article, it was shown that planar F-minior-free deletion problems do not have uniformly polynomial kernels, unless NP ⊆ coNP/poly, not even when parameterized by the vertex cover number.
Journal ArticleDOI
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
TL;DR: It is deduced that a large family of problems, e.g., Treewidth, Minimum Fill-in, Longest Induced Path, Feedback vertex set and many others, can be solved in time.
References
More filters
Book
Graph Theory
TL;DR: Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
Book
Parameterized Complexity
TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Book
Parameterized complexity theory
Jörg Flum,Martin Grohe +1 more
TL;DR: Fixed-Parameter Tractability.
Journal ArticleDOI
Partitioning sparse matrices with eigenvectors of graphs
TL;DR: In this paper, it is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph.
Book
Invitation to fixed-parameter algorithms
TL;DR: This paper discusses Fixed-Parameter Algorithms, Parameterized Complexity Theory, and Selected Case Studies, and some of the techniques used in this work.