1952 search results - page 182 / 391 » Complete partitions of graphs |
168
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
194
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
168
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
160
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
152
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...