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

11/24/2017
by   Krishnendu Chatterjee, et al.
0

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) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n √(D)) symbolic steps to achieve a (1+ϵ)-approximation for any constant ϵ > 0. This compares to O(n · D) symbolic steps for the (naive) exact algorithm and 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2020

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs

Among the most fundamental graph parameters is the Diameter, the largest...
research
08/12/2020

Improved SETH-hardness of unweighted Diameter

We prove that, assuming the Strong Exponential Time Hypothesis, for any ...
research
11/03/2022

Connected k-Center and k-Diameter Clustering

Motivated by an application from geodesy, we introduce a novel clusterin...
research
07/06/2021

Noisy Boolean Hidden Matching with Applications

The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper...
research
08/30/2021

BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs

Edge-coloured directed graphs provide an essential structure for modelli...
research
11/06/2017

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability

One of the simplest problems on directed graphs is that of identifying t...
research
05/20/2019

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems

Despite persistent efforts, there is no known technique for obtaining un...

Please sign up or login with your details

Forgot password? Click here to reset