Representation of Graphs by OBDDs

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.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Robin Nunkesser, Philipp Woelfel
• Keywords: Graph Classes, Interval Graphs, ISAAC 2005, Space Requirements