Results 1  10
of
341,934
New Graph Partitioning Algorithms
, 1998
"... Graph partitioning problems are NPcomplete and various heuristic algorithms exist in the litterature. Particularly, spectral graph partitioning algorithms partition the graph using the eigenvector associated with the second smallest eigenvalue of the "graph Laplacian." Through the use of ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Graph partitioning problems are NPcomplete and various heuristic algorithms exist in the litterature. Particularly, spectral graph partitioning algorithms partition the graph using the eigenvector associated with the second smallest eigenvalue of the "graph Laplacian." Through the use
Fast Graph Partitioning Algorithms
, 1995
"... In this work, the following kway graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partitioncost (sum of the weights on edges with nodes in different parts) is minimized. Two simple ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work, the following kway graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partitioncost (sum of the weights on edges with nodes in different parts) is minimized. Two simple
Engineering Graph Partitioning Algorithms
"... The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel processing. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel processing
Randomized Graph Partitioning Algorithms
, 1997
"... In this project, we have studied and worked on results and algorithms centered around (global) minimum cuts in graphs. A cut is a minimal set of edges whose removal from a connected graph disconnects it and a minimum cut is a cut of least capacity. We analyze the combinatorial structure of the set o ..."
Abstract
 Add to MetaCart
In this project, we have studied and worked on results and algorithms centered around (global) minimum cuts in graphs. A cut is a minimal set of edges whose removal from a connected graph disconnects it and a minimum cut is a cut of least capacity. We analyze the combinatorial structure of the set
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
Engineering Multilevel Graph Partitioning Algorithms
"... We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining these technique ..."
Abstract

Cited by 31 (16 self)
 Add to MetaCart
We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining
Graph Partitioning Algorithms With Applications To Scientific Computing
 Parallel Numerical Algorithms
, 1997
"... Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of su ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We describe the terminology associated with graph partitioning, the complexity of computing good separators
Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations
, 1998
"... This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on the problem of distributing workloads for parallel computations. Geometric, structural, and refinementbased algorithms are described and contrasted. In addition, multilevel partitioning techniques and ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on the problem of distributing workloads for parallel computations. Geometric, structural, and refinementbased algorithms are described and contrasted. In addition, multilevel partitioning techniques
THE INFLUENCE OF RANDOM NUMBER GENERATORS ON GRAPH PARTITIONING ALGORITHMS
"... Abstract. Many modern heuristic algorithms rely at least in some part on random numbers. Using graph partitioning algorithms as an example, we demonstrate the often underestimated influence of these randomnumber generators on the result of the heuristic algorithms. Even methods that rely on random ..."
Abstract
 Add to MetaCart
Abstract. Many modern heuristic algorithms rely at least in some part on random numbers. Using graph partitioning algorithms as an example, we demonstrate the often underestimated influence of these randomnumber generators on the result of the heuristic algorithms. Even methods that rely on random
Results 1  10
of
341,934