11,861 research outputs found

    Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter

    Full text link
    A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and co-liveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D)O(D) symbolic operations, where DD is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires O~(nD)\tilde{O}(n \sqrt{D}) symbolic steps to achieve a (1+ϵ)(1+\epsilon)-approximation for any constant ϵ>0\epsilon > 0. This compares to O(n⋅D)O(n \cdot D) symbolic steps for the (naive) exact algorithm and O(D)O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of Gentilini et al., showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components

    An O∗(1.0821n)O^*(1.0821^n)-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3

    Full text link
    We give an O∗(1.0821n)O^*(1.0821^n)-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem

    Kernelization and Sparseness: the case of Dominating Set

    Get PDF
    We prove that for every positive integer rr and for every graph class G\mathcal G of bounded expansion, the rr-Dominating Set problem admits a linear kernel on graphs from G\mathcal G. Moreover, when G\mathcal G is only assumed to be nowhere dense, then we give an almost linear kernel on G\mathcal G for the classic Dominating Set problem, i.e., for the case r=1r=1. These results generalize a line of previous research on finding linear kernels for Dominating Set and rr-Dominating Set. However, the approach taken in this work, which is based on the theory of sparse graphs, is radically different and conceptually much simpler than the previous approaches. We complement our findings by showing that for the closely related Connected Dominating Set problem, the existence of such kernelization algorithms is unlikely, even though the problem is known to admit a linear kernel on HH-topological-minor-free graphs. Also, we prove that for any somewhere dense class G\mathcal G, there is some rr for which rr-Dominating Set is W[22]-hard on G\mathcal G. Thus, our results fall short of proving a sharp dichotomy for the parameterized complexity of rr-Dominating Set on subgraph-monotone graph classes: we conjecture that the border of tractability lies exactly between nowhere dense and somewhere dense graph classes.Comment: v2: new author, added results for r-Dominating Sets in bounded expansion graph
    • …
    corecore