352 search results - page 8 / 71 » Partitioning Graphs into Connected Parts |
JGT
2006
14 years 9 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
IVC
2007
14 years 9 months ago
2007
In this paper connected operators from mathematical morphology are extended to a wider class of operators, which are based on connectivities in higher-dimensional spaces, similar ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
60
Voted
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
96
Voted
PAMI
2006
14 years 9 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...