1221 search results - page 26 / 245 » Balanced graph partitioning |
ISSS
1999
IEEE
14 years 1 months ago
1999
IEEE
Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is...
JDA
2006
13 years 8 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
ARSCOM
1999
13 years 8 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...