Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

ISAAC
2005
Springer

favoriteEmaildiscussreport

93views Algorithms» more ISAAC 2005»

Representation of Graphs by OBDDs

13 years 9 months ago

Representation of Graphs by OBDDs

Download pages.cpsc.ucalgary.ca

Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, speciﬁcally 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.

Robin Nunkesser, Philipp Woelfel

Real-time Traffic

Graph Classes | Interval Graphs | ISAAC 2005 | Space Requirements |

claim paper

Related Content

» What Graphs can be Efficiently Represented by BDDs

» A Lower Bound on the Size of Decomposable Negation Normal Form

» Lower Bounds on the OBDD Size of Graphs of Some Popular Functions

» Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard

» Testing Computability by Width Two OBDDs

» Speeding up symbolic model checking by accelerating dynamic variable reordering

» Ordered Kronecker functional decision diagramsa data structure for representation and mani...

» On Symbolic Scheduling Independent Tasks with Restricted Execution Times

» Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Robin Nunkesser, Philipp Woelfel

Comments (0)