Modern heuristic techniques for combinatorial problems
Parallel algorithms for VLSI computer-aided design
Parallel algorithms for VLSI computer-aided design
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Partitioning similarity graphs: a framework for declustering problems
Information Systems
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering
Journal of Parallel and Distributed Computing
Geometric Mesh Partitioning: Implementation and Experiments
SIAM Journal on Scientific Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Parallel optimisation algorithms for multilevel mesh partitioning
Parallel Computing - Special issue on graph partioning and parallel computing
A unified algorithm for load-balancing adaptive scientific simulations
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
A Mixed Heuristic for Circuit Partitioning
Computational Optimization and Applications
Multilevel heuristic algorithm for graph partitioning
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Implementation of scatter search for multi-objective optimization: a comparative study
Computational Optimization and Applications
Parallelism on multicore processors using Parallel.FX
Advances in Engineering Software
Expert Systems with Applications: An International Journal
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
Computers and Industrial Engineering
Hi-index | 0.00 |
One significant problem of optimisation which occurs in many scientific areas is that of graph partitioning. Several heuristics, which pertain to high quality partitions, have been put forward. Multilevel schemes can in fact improve the quality of the solutions. However, the size of the graphs is very large in many applications, making it impossible to effectively explore the search space. In these cases, parallel processing becomes a very useful tool overcoming this problem. In this paper, we propose a new parallel algorithm which uses a hybrid heuristic within a multilevel scheme. It is able to obtain very high quality partitions and improvement on those obtained by other algorithms previously put forward.