Symbolic Graphs: Linear Solutions to Connectivity Related Problems

@article{Gentilini2007SymbolicGL,
  title={Symbolic Graphs: Linear Solutions to Connectivity Related Problems},
  author={Raffaella Gentilini and Carla Piazza and Alberto Policriti},
  journal={Algorithmica},
  year={2007},
  volume={50},
  pages={120-158}
}
Abstract The importance of symbolic data structures such as Ordered Binary Decision Diagrams (OBDD) is rapidly growing in many areas of Computer Science where the large dimensions of the input models is a challenging feature: OBDD based graph representations allowed to define truly new standards in the achievable dimensions for the Model Checking verification technique. However, OBDD representations pose strict constraints in the algorithm design issue. For example, Depth-First Search (DFS) is… 

Symbolic OBDD-Based Reachability Analysis Needs Exponential Space

  • B. Bollig
  • Computer Science, Mathematics
    SOFSEM
  • 2010
TLDR
An exponential lower bound on the space complexity of an arbitrary OBDD-based algorithm for the reachability problem is presented and a general exponentialLower bound is obtained for the computation of OBDDs representing all connected node pairs in a graph, the transitive closure.

Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks

TLDR
The first exponential lower bound on the space complexity of OBDD-based algorithms for the maximum flow problem in 0-1 networks is presented.

On symbolic OBDD-based algorithms for the minimum spanning tree problem

  • B. Bollig
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2010

On Symbolic Representations of Maximum Matchings and (Un)directed Graphs

  • B. Bollig
  • Computer Science, Mathematics
    IFIP TCS
  • 2010
TLDR
It is shown that symbolic OBDD-based algorithms for the maximum matching problem need exponential space (with respect to the O BDD size of the input graph) and it is shown That OBDd-representations for undirected graphs can be exponentially larger than OBD D-representation for their directed counterparts and vice versa.

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

TLDR
Lower bounds on the number of symbolic operations are given 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.

On the OBDD representation of some graph classes

Exponential space complexity for OBDD-based reachability analysis

  • B. Bollig
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 2010

OBDD-Based Representation of Interval Graphs

TLDR
This paper shows that the OBDD size of unit interval graphs is O( ∣ V ∣ /log ∣ v ∣ ) and theOBDD sizes of interval graphs are O(∣V ∣ log∣ V∣ ) which both improve a known result from Nunkesser and Woelfel (2009) and can be provable small for special graph classes.

Symbolic Time and Space Tradeoffs for Probabilistic Verification

TLDR
A faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs) and considers the canonical parity objectives for ω-regular objectives.

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

TLDR
A novel algorithm is proposed that symbolically computes all the monochromatic strongly connected components of an edge-coloured graph and uses it to explore the SCCs of a large collection of coloured graphs obtained from Boolean networks – a modelling framework commonly appearing in systems biology.

References

SHOWING 1-10 OF 51 REFERENCES

A Symbolic Approach to the All-Pairs Shortest-Paths Problem

TLDR
This paper presents a symbolic algorithm for the all-pairs shortest-paths (APSP) problem in loopless directed graphs with strictly positive integral edge weights and proves that runtime and space usage are polylogarithmic w.

Implicit Flow Maximization by Iterative Squaring

TLDR
An implicit algorithm for flow maximization in 0–1 networks is presented, which works on OBDD-representations of node and edge sets, which avoids breadth-first searches and layer-wise proceeding, and uses iterative squaring instead.

Symbolic model checking: an approach to the state explosion problem

TLDR
The symbolic model checking technique revealed subtle errors in this protocol, resulting from complex execution sequences that would occur with very low probability in random simulation runs, and an alternative method is developed for avoiding the state explosion in the case of asynchronous control circuits.

Graph-Based Algorithms for Boolean Function Manipulation

  • R. Bryant
  • Computer Science
    IEEE Transactions on Computers
  • 1986
TLDR
Experimental results from applying a new data structure for representing Boolean functions and an associated set of manipulation algorithms to problems in logic design verification demonstrate the practicality of this approach.

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

TLDR
The algorithm can be used to decide emptiness of Büchi automata with the same complexity bound, improving Emerson and Lei's quadratic bound, and emptiness of Streett automata, with a similar bound in terms of nodes.

Symbolic Boolean manipulation with ordered binary-decision diagrams

TLDR
The OBDD data structure is described and a number of applications that have been solved by OBDd-based symbolic analysis are surveyed.

Symbolic topological sorting with OBDDs

Computing strongly connected components in a linear number of symbolic steps

TLDR
An algorithm that computes in a linear number of symbolic steps the strongly connected components of a graph represented by an Ordered Binary Decision Diagram (OBDD) matches the complexity of Tarjan's algorithm operating on explicit data structures.

BDDs--design, analysis, complexity, and applications

  • I. Wegener
  • Computer Science
    Discret. Appl. Math.
  • 2004
...