Results 1  10
of
317
Analytical Methods for Multilevel GraphPartitioning
, 1999
"... he multilevel strategy is widely used for graph partitioning. We discuss analytical methods for the central parts of this approach, i.e. for the graph coarsening and the local improvement. ..."
Abstract
 Add to MetaCart
he multilevel strategy is widely used for graph partitioning. We discuss analytical methods for the central parts of this approach, i.e. for the graph coarsening and the local improvement.
Quality Matching and Local Improvement for Multilevel GraphPartitioning
, 1999
"... Multilevel strategies have proven to be very powerful approaches in order to partition graphs efficiently. Their efficiency is dominated by two parts; the coarsening and the local improvement strategies. Several methods have been developed to solve these problems, but their efficiency has only been ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
Multilevel strategies have proven to be very powerful approaches in order to partition graphs efficiently. Their efficiency is dominated by two parts; the coarsening and the local improvement strategies. Several methods have been developed to solve these problems, but their efficiency has only been
Multilevel Graph Partitioning Schemes
 Proc. 24th Intern. Conf. Par. Proc., III
, 1995
"... Abstract – 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 graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of ma ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
partition obtained after multilevel refinement. We also present a new scheme for refining during uncoarsening that is much faster than the KernighanLin refinement. We test our scheme on a large number of graphs arising in various domains including finite element methods, linear programming, VLSI
Weighted graph cuts without eigenvectors: A multilevel approach
 IEEE TRANS. PATTERN ANAL. MACH. INTELL
, 2007
"... A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel kmeans are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods—in par ..."
Abstract

Cited by 175 (22 self)
 Add to MetaCart
, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods such as Metis have suffered from the restriction of equalsized clusters; our
Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm
, 1998
"... Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement o ..."
Abstract

Cited by 81 (22 self)
 Add to MetaCart
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement
Integrating Multilevel Graph Partitioning with Hierarchical Set . . .
 PREPRINT 152 OF THE DFG SCHWERPUNKTPROGRAMM 1095
, 2004
"... Dynamical systems from real applications are usually very complex and difficult to handle. Recently, the combination of hierarchical set oriented methods and of multilevel graph partitioning methods has been used for the analysis of the almost invariant sets of the system which are a key characteris ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Dynamical systems from real applications are usually very complex and difficult to handle. Recently, the combination of hierarchical set oriented methods and of multilevel graph partitioning methods has been used for the analysis of the almost invariant sets of the system which are a key
Multilevel Reactive Tabu Search for Graph Partitioning
, 1999
"... In this paper, new multilevel heuristics are proposed for finding a balanced bipartition of a graph. Multilevel schemes have been recently introduced for quickly solving the problem on graphs with thousands of nodes, graphs often present in domaindecomposition techniques for parallel computing. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. These heuristics firstly reduce the original graph by collapsing its nodes and arcs, thus generating a hierarchy of smaller and smaller graphs, then find a good partition of the smallest graph, and finally project and refine the so found partition backwards on the graph hierarchy. The multilevel algorithms
How to partition a billionnode graph
 In ICDE
, 2014
"... Abstract—Billionnode graphs pose significant challenges at all levels from storage infrastructures to programming models. It is critical to develop a general purpose platform for graph processing. A distributed memory system is considered a feasible platform supporting online query processing as we ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
as well as offline graph analytics. In this paper, we study the problem of partitioning a billionnode graph on such a platform, an important consideration because it has direct impact on load balancing and communication overhead. It is challenging not just because the graph is large, but because we can
Partitioning Graphs of Regular Degree
, 1998
"... GraphPartitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NPcomplete. We show a new strategy to derive upper bounds o ..."
Abstract
 Add to MetaCart
on the bisection width of graphs with regular degree. It gives optimal upper bounds for very small 3regular graphs and also the best known asymptotic upper bound for large 3regular graphs. The PARTY GraphPartitioning library includes several partitioning methods of different character. It has successfully been
Partitioning a Call Graph
"... Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
to optimality, but this becomes very costly with increasing size of the software system. Second, we formulate the problem as a hypergraph partitioning problem. This is a heuristic method using a multilevel strategy, but it turns out to be very fast and to deliver solutions that are close to optimal. 1
Results 1  10
of
317