Results 1  10
of
114,455
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 172 (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
Analysis of Multilevel Graph Partition Algorithm
"... All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through th ..."
Abstract
 Add to MetaCart
All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through
Graph Partitioning in Scientific Simulations: Multilevel Schemes versus SpaceFilling Curves
"... Using spacefilling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach is relatively easy to implement and very fast. ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Using spacefilling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach is relatively easy to implement and very fast
Partitioning Properties of General Graphs
, 2003
"... this technical report, we will make an abstraction of the circuit concept, and focus on the partitioning properties of general graphs ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this technical report, we will make an abstraction of the circuit concept, and focus on the partitioning properties of general graphs
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
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
Multilevel Recursive Spectral Bisection
"... This thesis investigates a multilevel approach to a graph partitioning method calles spectral bisection. The main... ..."
Abstract
 Add to MetaCart
This thesis investigates a multilevel approach to a graph partitioning method calles spectral bisection. The main...
Results 1  10
of
114,455