1420 search results - page 36 / 284 » Representation of Graphs by OBDDs |
136
click to vote
DM
2006
15 years 6 months ago
2006
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
180
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
152
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
169
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
163
click to vote
ICCD
1995
IEEE
15 years 9 months ago
1995
IEEE
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...