Results 1  10
of
144,907
A Parallelization of StateoftheArt Graph Bisection Algorithms on the Grid
"... We have parallelized Reactive Randomized Tabu Search (RRTS) graph partition algorithm and adapted it to the grid environment. Speedup is achieved by parallelizing scoring phase of RRTS. We also introduced two techniques: multilevel scoring and parallel initialization. By using multilevel scoring, ta ..."
Abstract
 Add to MetaCart
, tabu lengths are highly tuned to adapt large graphs. And by parallel initialization, dispersed computing efforts are centralized to output more consistent graph partitions. Experiments show that our approach significantly outperformed stateoftheart heuristics by partitioning large graphs with higher
An Implementation of StateoftheArt Graph Bisection Algorithms ∗
, 2006
"... In recent decades, various graph partitioning heuristic algorithms have been developed by researchers, which are widely used in “realworld” applications. As a starting point of graph partition problem, graph bisection algorithms provide basic approaches and solutions for other graph partition instan ..."
Abstract
 Add to MetaCart
In recent decades, various graph partitioning heuristic algorithms have been developed by researchers, which are widely used in “realworld” applications. As a starting point of graph partition problem, graph bisection algorithms provide basic approaches and solutions for other graph partition
MULTILEVEL OPTIMIZATION OF GRAPH BISECTION WITH PHEROMONES
"... Abstract We present a multiple antcolony algorithm (MACA) for the graph bisection problem. The aim of this paper is to compare the performance of the MACA with results on the benchmark graphs from Graph partitioning Archive at the University of Greenwich. Experimental results show that the MACA is ..."
AND THE STATEOFTHEART
"... Our goal in this article is to give an overview of the broad area ..."
AND THE STATEOFTHEART
"... Our goal in this article is to give an overview of the broad area of realtime systems. This task daunting because real ..."
Abstract
 Add to MetaCart
Our goal in this article is to give an overview of the broad area of realtime systems. This task daunting because real
Multilevel hypergraph partitioning: Application in VLSI domain
 IEEE TRANS. VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS
, 1999
"... In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the origina ..."
Abstract

Cited by 315 (22 self)
 Add to MetaCart
than those produced by other stateoftheart schemes. Furthermore, our partitioning algorithm is significantly faster, often requiring 4–10 times less time than that required by the other schemes. Our multilevel hypergraphpartitioning algorithm scales very well for large hypergraphs. Hypergraphs
Partitioning of Unstructured Problems for Parallel Processing
, 1991
"... Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address th ..."
Abstract

Cited by 344 (16 self)
 Add to MetaCart
a new decomposition algorithm will be discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large scale two and three dimensional problems demonstrate the superiority of the new spectral bisection algorithm.
Improved Approximation Algorithms for MAX kCUT and MAX BISECTION
, 1994
"... Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks ..."
Abstract

Cited by 176 (0 self)
 Add to MetaCart
Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks
How Good is Recursive Bisection?
 SIAM J. Sci. Comput
, 1995
"... . The most commonly used pway partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm. Becaus ..."
Abstract

Cited by 100 (5 self)
 Add to MetaCart
. The most commonly used pway partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm
Simulated annealing for graph bisection
 in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science
, 1993
"... We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, find the optimal bisection of a random graph in Gnpr when p r = O(n*’) for A 5 2. (The random graph model Gnpr specifies a “planted ” bisection of density r, ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, find the optimal bisection of a random graph in Gnpr when p r = O(n*’) for A 5 2. (The random graph model Gnpr specifies a “planted ” bisection of density r
Results 1  10
of
144,907