248 research outputs found

    The 2-linkage problem for acyclic digraphs

    Get PDF
    We consider the problem of finding two disjoint directed paths with prescribed ends in an acylic digraph. We solve this by reducing it to a problem of planarity testing of an undirected graph and we apply this to give a necessary and sufficient condition, in terms of forbidden subdigraphs, for a digraph to contain a vertex meeting all cycles of the digraph. It follows immediately that, if any three cycles of a digraph have a common vertex, then all cycles have a common vertex as proved by Kosaraju [7]. As another consequence we obtain a precise structural characterization of digraphs of order n and girth g ⩾ 2/3n. From this we get the result of Allender [1] that any such digraph has at most 3n − g distinct cycles. We also prove the conjecture of Allender that a digraph of order n and girth g ⩾ 4 has at most 2n − g shortest cycles

    On Complexity of Minimum Leaf Out-branching Problem

    Get PDF
    Given a digraph DD, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in DD an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. Gutin, Razgon and Kim (2008) proved that MinLOB is polynomial time solvable for acyclic digraphs which are exactly the digraphs of directed path-width (DAG-width, directed tree-width, respectively) 0. We investigate how much one can extend this polynomiality result. We prove that already for digraphs of directed path-width (directed tree-width, DAG-width, respectively) 1, MinLOB is NP-hard. On the other hand, we show that for digraphs of restricted directed tree-width (directed path-width, DAG-width, respectively) and a fixed integer kk, the problem of checking whether there is an out-branching with at most kk leaves is polynomial time solvable

    Are there any good digraph width measures?

    Full text link
    Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all \MS1-definable problems on digraphs of bounded width. And, second, having nice \emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) \MS1 seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the edge/arc relation on the vertex set.The latter property is a necessary condition for a width measure to be characterizable by some version of the cops-and-robber game characterizing the ordinary treewidth. Our main result is that \emph{any reasonable} algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph. Moreover, we introduce \emph{directed topological minors} and argue that they are the weakest useful notion of minors for digraphs

    Finding an induced subdivision of a digraph

    Get PDF
    We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) GG, does it contain an induced subdivision of a prescribed digraph DD? The complexity of this problem depends on DD and on whether GG must be an oriented graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs

    The directed 2-linkage problem with length constraints

    Get PDF
    Postponed access: the file will be available after 2022-01-15acceptedVersio

    Are there any good digraph width measures?

    Get PDF
    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
    • …
    corecore