103 search results - page 2 / 21 » Graph partitioning using single commodity flows |
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
WEA
2009
Springer
13 years 9 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 ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
WCET
2008
13 years 6 months ago
2008
IMC
2004
ACM
13 years 10 months ago
2004
ACM
The capacity of today's network links, along with the heterogeneity of their traffic, is rapidly growing, more than the workstation’s processing power. This makes the task ...