Representation of graphs by OBDDs

Authors:
Robin Nunkesser;Philipp Woelfel
Affiliations:
FB Informatik, LS2, Universität Dortmund, Dortmund, Germany;University of Toronto, Toronto, Canada
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 9
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Counting unlabeled structures

Journal of Combinatorial Theory Series A
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
On the size of binary decision diagrams representing Boolean functions

Theoretical Computer Science
A Symbolic Algorithms for Maximum Flow in 0-1 Networks

Formal Methods in System Design
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Random I‐colorable graphs

Random Structures & Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, 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.