1221 search results - page 27 / 245 » Balanced graph partitioning |
ICPP
1998
IEEE
14 years 1 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
PC
2000
13 years 8 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
COMBINATORICA
2006
13 years 8 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...