352 search results - page 6 / 71 » Partitioning Graphs into Connected Parts |
DAGM
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
65
Voted
DM
2000
14 years 9 months ago
2000
For integers p; q; s with p
GC
2011
Springer
14 years 1 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
AIPS
2011
14 years 1 months ago
2011
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller