200 search results - page 5 / 40 » What Graphs can be Efficiently Represented by BDDs |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
JMLR
2008
13 years 7 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
ISPAN
2008
IEEE
14 years 1 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...