Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms

@inproceedings{Sawitzki2006ExponentialLB,
title={Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms},
author={Daniel Sawitzki},
booktitle={LATIN},
year={2006}
}

Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which is successfully applied in many areas like Integer Programming, Model Checking, and Relational Algebra. Nevertheless, many basic graph problems like Connectivity, Reachability, Single-Source Shortest-Paths, and Flow Maximization are known to be PSPACE-hard if their input graphs are represented by OBDDs. This holds even for input OBDDs of constant width. We extend these results by concrete exponential lowerâ€¦Â CONTINUE READING