Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Journal of Combinatorial Theory Series A
Implicit representation of graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On a unique tree representation for P4-extendible graphs
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
A tree representation for P4-sparse graphs
Discrete Applied Mathematics
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
On the size of binary decision diagrams representing Boolean functions
Theoretical Computer Science
Random Structures & Algorithms
The nonapproximability of OBDD minimization
Information and Computation
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
A symbolic approach to the all-pairs shortest-paths problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
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
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
| Hi-index | 0.05 |
Recently, it has been shown in a series of works that the representation of graphs by Ordered Binary Decision Diagrams (OBDDs) often leads to good algorithmic behavior. However, the question for which graph classes an OBDD representation is advantageous, has not been investigated, yet. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P"4s, unit interval graphs, interval graphs and bipartite graphs are investigated. Upper and lower bounds are proven for all these graph classes and it is shown that in most (but not all) cases a representation of the graphs by OBDDs is advantageous with respect to space requirements.