352 search results - page 10 / 71 » Partitioning Graphs into Connected Parts |
COMBINATORICA
2007
14 years 11 months 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 ...
119
click to vote
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
COMBINATORICA
2008
14 years 10 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...
113
click to vote
ICML
2003
IEEE
16 years 15 days ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...