2314 search results - page 203 / 463 » Minimal Partitions of a Graph |
126
click to vote
TALG
2008
15 years 4 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
132
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
154
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
149
click to vote
PKDD
2010
Springer
15 years 2 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...
138
click to vote
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...