2314 search results - page 36 / 463 » Minimal Partitions of a Graph |
ARSCOM
2008
15 years 29 days ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
97
Voted
COMBINATORICA
2007
15 years 12 days ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
116
Voted
CCCG
2010
15 years 2 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
84
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
123
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...