Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs

  title={Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs},
  author={Ren{\'e} van Bevern and Sepp Hartung and Frank Kammer and Rolf Niedermeier and Mathias Weller},
We present a linear-time kernelization algorithm that transforms a given planar graph G with domination number γ(G) into a planar graph G′ of size O(γ(G)) with γ(G)=γ(G′). In addition, a minimum dominating set for G can be inferred from a minimum dominating set for G′. In terms of parameterized algorithmics, this implies a linear-size problem kernel for the NP-hard Dominating Set problem on planar graphs, where the kernelization takes linear time. This improves on previous kernelization… 
A linear kernel for planar total dominating set
This work provides an explicit kernel for Total Dominating Set on planar graphs with at most $410k$ vertices, where $k$ is the size of the solution.
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
This thesis aims for the development of efficient algorithms to exactly solve four selected NPhard graph and hypergraph problems arising in the fields of scheduling, steel manufacturing, software
Towards Optimal and Expressive Kernelization for d-Hitting Set
This work provides a linear-time algorithm that, by finding sunflowers, transforms an instance of d-Hitting Set into an equivalent instance comprising at most O(kd) hyperedges and vertices and shows a problem kernel with asymptotically optimal size and experimental results that show the practical applicability of the algorithm.
Treewidth Computation and Kernelization in the Parallel External Memory Model
A randomized algorithm which computes, for any fixed k, a tree decomposition of width at most k of any input graph is presented, which has sorting complexity, which proves to be optimal for a large parameter range.
On Optimal Algorithms for List Ranking in the Parallel External Memory Model with Applications to Treewidth and other Elementary Graph Problems
By modeling how list ranking algorithms retrieve information on the structure of the list in the memory, a lower bound is given that is quadratic in sorting complexity for certain parameter settings, the first non-trivial lower bounds for list ranking for the bulk synchronous parallel and the MapReduce model.
A Bibliography of Papers in Lecture Notes in Computer Science (2012): Volumes 6121{7125
(∆ + 1) [1577]. (ρ,G) [266]. (r|p) [781]. 1 [1022]. 1 [1342]. 2 [27, 1294, 1138, 432, 1028, 281, 758, 272, 1440, 546, 861, 867, 1352, 578, 561]. 3 [579, 1293, 1381, 176, 1355, 1623, 1294, 1012, 1358,
Big data algorithms beyond machine learning
  • M. Mnich
  • Computer Science
    KI - Künstliche Intelligenz
  • 2017
This work surveys some algorithmic methods that optimize over large-scale data sets, beyond the realm of machine learning.
Space-efficient Graph Algorithms Succinct Choice Dictionaries
Fixed-parameter algorithms for DAG Partitioning


Linear Problem Kernels for Planar Graph Problems with Small Distance Property
This paper introduces a simple partition of the vertex set to analyze kernels for planar graph problems which admit the distance property with small constants, and derives new kernelization algorithms for Connected Vertex Cover, Edge Dominating Set, and Maximum Triangle Packing problems, further improving the kernel size upper bounds for these problems.
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
A generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs is developed, giving new kernelization results for CONNECTED VERTEX COVER, MINIMUM EDGE DOMINATING SET, MAXIMUM TRIANGLE PACKing, and EFFICIENT DOMINating Set onPlanar graphs.
Polynomial-time data reduction for dominating set
It is proved that Dominating Set restricted to planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy-to-implement reduction rules.
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
This work shows an O(k11) kernelization bound for the Undirected Feedback Vertex Set problem, which is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance to a decision-equivalent simplified instance.
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
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.
(Meta) Kernelization
The theorems unify and extend all previously known kernelization results for planar graph problems and show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness property admit a polynomial kernel on graphs of bounded genus.
Kernelization: New Upper and Lower Bound Techniques
This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems, in particular for planar graphs and generalizations ofPlanar graphs, and recent lower bound techniques that give evidence that certain types of kernels do not exist.
Subexponential parameterized algorithms
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings
Applying Modular Decomposition to Parameterized Bicluster Editing and Fixed Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual are presented.
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
An upper bound of 67k is derived on the problem kernel for planar dominating set improving the previous 335k upper bound by Alber et al.