Progressive Algorithms for Domination and Independence

  title={Progressive Algorithms for Domination and Independence},
  author={Grzegorz Fabianski and Michał Pilipczuk and Sebastian Siebertz and Szymon Toruńczyk},
We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two model-theoretic properties that lead to efficient progressive algorithms, namely variants of the Helly property and stability. We demonstrate our approach by giving linear-time fixed-parameter algorithms for the distance-r dominating set problem (parameterized by the solution size) in a wide variety of restricted graph… Expand
Algorithmic Properties of Sparse Digraphs
It is shown that the directed Steiner tree problem is fixed-parameter tractable on any class of directed bounded expansion parameterized by the number of non-terminals plus the maximal diameter in the subgraph induced by the terminals, and thereby highlights a rich algorithmic structure theory ofdirected bounded expansion classes. Expand
Distributed Domination on Graph Classes of Bounded Expansion
A new constant factor approximation algorithm for the (connected) \mboxdistance- r dominating set problem on graph classes of bounded expansion, based on a distributed computation of sparse neighborhood covers of small radius on bounded expansion classes. Expand
Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019
These notes, prepared for a tutorial at Highlights of Logic, Games and Automata 2019, are a brief introduction to the theory of nowhere denseness, driven by algorithmic applications. Expand
Rankwidth meets stability
Monadic stability and monadic dependence extend classical structural notions for graphs by viewing them in a wider, model-theoretical context by proving that classes with bounded rankwidth excluding some half-graph as a semi-induced subgraph are linearly $\chi$-bounded. Expand
Parameterized Distributed Complexity Theory: A logical approach
This work defines the levels of the Distributed-W-hierarchy and the Distributes that have first-order model-checking problems as their complete problems via suitable reductions and follows a logical approach that leads to a more robust theory. Expand
Clustering powers of sparse graphs
It is proved that if G is a sparse graph and d in N is fixed, then thedth power of G can be partitioned into cliques so that contracting each of these clique to a single vertex again yields a sparse graphs. Expand
Constant Round Distributed Domination on Graph Classes with Bounded Expansion
We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. ThisExpand
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
The parameterized complexity of the Connected Dominating Set Reconfiguration problem is studied, and it is shown that the CDS-R parameterized by $k$ is fixed-parameter tractable, and in fact admits a polynomial kernel on planar graphs. Expand
Linear rankwidth meets stability
This work takes both views on classes with bounded linear rankwidth and proves structural and model theoretic properties of these classes, and shows a strong link between these graph classes considered from the point of view of structural graph theory and finite model theory. Expand


Domination Problems in Nowhere-Dense Classes
It is shown that the distance-$d$ dominating-set problem, also known as the $(k,d)$-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs. Expand
FPT Algorithms for Domination in Biclique-Free Graphs
It is shown that various domination problems are fixed-parameter tractable on biclique-free classes of graphs, when parameterizing by both solution size and t. Expand
Testing first-order properties for subclasses of sparse graphs
It is deduced that there is an almost linear-time algorithm for deciding first-order (FO) properties in classes of graphs with locally bounded expansion and a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion is designed. Expand
Deciding First-Order Properties of Nowhere Dense Graphs
The proofs are based on a new game-theoretic characterization of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes and prove a “rank-preserving” version of Gaifman’s locality theorem. Expand
On nowhere dense graphs
The nowhere dense versus somewhere dense dichotomy is expressed in terms of edge densities as a trichotomy theorem and has a number of applications to mathematical logic, complexity of algorithms, and combinatorics. Expand
Neighborhood complexity and kernelization for nowhere dense classes of graphs
We prove that whenever G is a graph from a nowhere dense graph class C, and A is a subset of vertices of G, then the number of subsets of A that are realized as intersections of A withExpand
Sparsity - Graphs, Structures, and Algorithms
This is the first book devoted to the systematic study of sparse graphs and sparse finite structures and the authors devised an unifying classification of general classes of structures that is very robust and has many remarkable properties. Expand
Interpreting nowhere dense graph classes as a classical notion of model theory
It is observed that this recent tameness notion from (algorithmic) graph theory is essentially the earlier stability theoretic notion of superflatness, and for subgraph-closed classes of graphs it is proved equivalence to stability and to not having the independence property. Expand
Parameterized Complexity of First-Order Logic
It is shown that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C, which essentially gives a precise characterisation of classes for which FO model- checking is tractable. Expand
Approximation Algorithms for Independent Sets in Map Graphs
This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is givenExpand