1952 search results - page 50 / 391 » Complete partitions of graphs |
ICTAI
2010
IEEE
13 years 8 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
COMBINATORICA
2008
13 years 8 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
PAKDD
2004
ACM
14 years 3 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...