A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
OBDD-Based Representation of Interval Graphs
[chapter]
2013
Lecture Notes in Computer Science
A graph G = (V, E) can be described by the characteristic function of the edge set χ E which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using Ordered Binary Decision Diagrams (OBDDs) to store χ E can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve optimization problems by mainly using functional operations, e. g., quantification or binary synthesis. While the OBDD representation size can
doi:10.1007/978-3-642-45043-3_25
fatcat:mf3pqnybxvhcrk6ffd6kcpr2ia