14 search results - page 1 / 3 » Comparison of Coarsening Schemes for Multilevel Graph Partit... |
LION
2009
Springer
13 years 11 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
ICPP
1995
IEEE
13 years 8 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...
JPDC
2008
13 years 4 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
PPSC
1997
13 years 5 months ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
ANOR
2004
13 years 4 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...