Succinct representations of graphs
Information and Control
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A note on succinct representations of graphs
Information and Control
The complexity of graph problems for succinctly represented graphs
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Verification of Synchronous Sequential Machines Based on Symbolic Execution
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
New Results on the Most Significant Bit of Integer Multiplication
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the OBDD complexity of the most significant bit of integer multiplication
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Lower bounds on the OBDD size of graphs of some popular functions
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Exponential lower bounds on the space complexity of OBDD-Based graph algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
| Hi-index | 0.00 |
Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Nevertheless, many basic graph problems are known to be PSPACE-hard if their input graphs are represented by OBDDs. Despite the hardness results there are not many concrete nontrivial lower bounds known for the complexity of problems on OBDD-represented graph instances. Computing the set of vertices that are reachable from some predefined vertex s 驴 V in a directed graph G = (V,E) is an important problem in computer-aided design, hardware verification, and model checking. Until now only exponential lower bounds on the space complexity of a restricted class of OBDD-based algorithms for the reachability problem have been known. Here, the result is extended by presenting an exponential lower bound on the space complexity of an arbitrary OBDD-based algorithm for the reachability problem. As a by-product a general exponential lower bound is obtained for the computation of OBDDs representing all connected node pairs in a graph, the transitive closure.