11 research outputs found
On Directed Covering and Domination Problems
In this paper, we study covering and domination problems on directed graphs.
Although undirected Vertex Cover and Edge Dominating Set are well-studied classical graph problems, the directed versions have not been studied much due to the lack of clear definitions.
We give natural definitions for Directed r-In (Out) Vertex Cover and Directed (p,q)-Edge Dominating Set as directed generations of Vertex Cover and Edge Dominating Set.
For these problems, we show that
(1) Directed r-In (Out) Vertex Cover and Directed (p,q)-Edge Dominating Set are NP-complete on planar directed acyclic graphs except when r=1 or (p,q)=(0,0),
(2) if r>=2, Directed r-In (Out) Vertex Cover is W[2]-hard and (c*ln k)-inapproximable on directed acyclic graphs,
(3) if either p or q is greater than 1, Directed (p,q)-Edge Dominating Set is W[2]-hard and (c*ln k)-inapproximable on directed acyclic graphs,
(4) all problems can be solved in polynomial time on trees, and
(5) Directed (0,1),(1,0),(1,1)-Edge Dominating Set are fixed-parameter tractable in general graphs.
The first result implies that (directed) r-Dominating Set on directed line graphs is NP-complete even if r=1
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
Bounded expansion and nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of uniformly sparse graphs which includes the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs. Since their initial definition it was shown that these graph classes can be defined in many equivalent ways: by generalised colouring numbers, neighbourhood complexity, sparse neighbourhood covers, a game known as the splitter game, and many more.
We study the corresponding concepts for directed graphs. We show that the densities of bounded depth directed minors and bounded depth topological minors relate in a similar way as in the undirected case. We provide a characterisation of bounded expansion classes by a directed version of the generalised colouring numbers. As an application we show how to construct sparse directed neighbourhood covers and how to approximate directed distance-r dominating sets on classes of bounded expansion. On the other hand, we show that linear neighbourhood complexity does not characterise directed classes of bounded expansion
Algorithmic Properties of Sparse Digraphs
The notions of bounded expansion [Nesetril and Ossona de Mendez, 2008] and nowhere denseness [Nesetril and Ossona de Mendez, 2011], introduced by Nesetril and Ossona de Mendez as structural measures for undirected graphs, have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs, introduced by Kreutzer and Tazari [Kreutzer and Tazari, 2012]. The classes of directed graphs having those properties are very general classes of sparse directed graphs, as they include, on one hand, all classes of directed graphs whose underlying undirected class has bounded expansion, such as planar, bounded-genus, and H-minor-free graphs, and on the other hand, they also contain classes whose underlying undirected class is not even nowhere dense. We show that many of the algorithmic tools that were developed for undirected bounded expansion classes can, with some care, also be applied in their directed counterparts, and thereby we highlight a rich algorithmic structure theory of directed bounded expansion and nowhere crownful classes
Are there any good digraph width measures?
Many width measures for directed graphs have been proposed in the last few years in pursuit of generalizing (the notion of) treewidth to directed graphs. However, none of these measures possesses, at the same time, the major properties of treewidth, namely, 1. being algorithmically useful , that is, admitting polynomial-time algorithms for a large class of problems on digraphs of bounded width (e.g. the problems definable in MSO1MSO1); 2. having nice structural properties such as being (at least nearly) monotone under taking subdigraphs and some form of arc contractions (property closely related to characterizability by particular cops-and-robber games). We investigate the question whether the search for directed treewidth counterparts has been unsuccessful by accident, or whether it has been doomed to fail from the beginning. Our main result states that any reasonable width measure for directed graphs which satisfies the two properties above must necessarily be similar to treewidth of the underlying undirected graph
New Results on Directed Edge Dominating Set
We study a family of generalizations of Edge Dominating Set on directed
graphs called Directed -Edge Dominating Set. In this problem an arc
is said to dominate itself, as well as all arcs which are at distance
at most from , or at distance at most to .
First, we give significantly improved FPT algorithms for the two most
important cases of the problem, -dEDS and -dEDS (that correspond
to versions of Dominating Set on line graphs), as well as polynomial kernels.
We also improve the best-known approximation for these cases from logarithmic
to constant. In addition, we show that -dEDS is FPT parameterized by
, but W-hard parameterized by (even if the size of the optimal is
added as a second parameter), where is the treewidth of the underlying
graph of the input.
We then go on to focus on the complexity of the problem on tournaments. Here,
we provide a complete classification for every possible fixed value of ,
which shows that the problem exhibits a surprising behavior, including cases
which are in P; cases which are solvable in quasi-polynomial time but not in P;
and a single case which is NP-hard (under randomized reductions) and
cannot be solved in sub-exponential time, under standard assumptions
The Directed Grid Theorem
The grid theorem, originally proved by Robertson and Seymour in Graph Minors
V in 1986, is one of the most central results in the study of graph minors. It
has found numerous applications in algorithmic graph structure theory, for
instance in bidimensionality theory, and it is the basis for several other
structure theorems developed in the graph minors project.
In the mid-90s, Reed and Johnson, Robertson, Seymour and Thomas (see [Reed
97, Johnson, Robertson, Seymour, Thomas 01]), independently, conjectured an
analogous theorem for directed graphs, i.e. the existence of a function f : N
-> N such that every digraph of directed tree-width at least f(k) contains a
directed grid of order k. In an unpublished manuscript from 2001, Johnson,
Robertson, Seymour and Thomas give a proof of this conjecture for planar
digraphs. But for over a decade, this was the most general case proved for the
Reed, Johnson, Robertson, Seymour and Thomas conjecture.
Only very recently, this result has been extended to all classes of digraphs
excluding a fixed undirected graph as a minor (see [Kawarabayashi, Kreutzer
14]). In this paper, nearly two decades after the conjecture was made, we are
finally able to confirm the Reed, Johnson, Robertson, Seymour and Thomas
conjecture in full generality and to prove the directed grid theorem.
As consequence of our results we are able to improve results in Reed et al.
in 1996 [Reed, Robertson, Seymour, Thomas 96] (see also [Open Problem Garden])
on disjoint cycles of length at least l and in [Kawarabayashi, Kobayashi,
Kreutzer 14] on quarter-integral disjoint paths. We expect many more
algorithmic results to follow from the grid theorem.Comment: 43 pages, 21 figure