5100 search results - page 107 / 1020 » The Linear Complexity of a Graph |
WWW
2010
ACM
14 years 4 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
CATS
2008
13 years 10 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
DAM
2000
13 years 9 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
ISAAC
1993
Springer
14 years 1 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
UAI
2008
13 years 10 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...