1221 search results - page 14 / 245 » Balanced graph partitioning |
EUROPAR
1999
Springer
13 years 12 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
ICPP
1995
IEEE
13 years 11 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
JCT
2007
13 years 7 months ago
2007
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex...
JHSN
2007
13 years 7 months ago
2007
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
PC
2008
13 years 7 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...