2314 search results - page 46 / 463 » Minimal Partitions of a Graph |
116
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
122
click to vote
INFOVIS
2000
IEEE
15 years 7 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
110
click to vote
COMBINATORICA
2008
15 years 1 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...
118
click to vote
PAKDD
2004
ACM
15 years 8 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...
113
click to vote
WEA
2009
Springer
15 years 7 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 ...