Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Finite element mesh partitioning using neural networks
Advances in Engineering Software
The ISPD98 circuit benchmark suite
ISPD '98 Proceedings of the 1998 international symposium on Physical design
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Solving the mesh-partitioning problem with an ant-colony algorithm
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
A hypergraph partitioning based approach for scheduling of tasks with batch-shared I/O
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
An effective multi-level algorithm for bisecting graph
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An effective multi-level algorithm based on simulated annealing for bisecting graph
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
| Hi-index | 0.00 |
Partitioning is a fundamental problem in diverse fields of study such as VLSI design, parallel processing, data mining and task scheduling. The min-cut bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level refinement algorithm based on swarm intelligence for bisecting graph. The success of our algorithm relies on exploiting both the swarm intelligence theory with a boundary refinement policy. Our experimental evaluations on 18 different benchmark graphs show that our algorithm produces high quality solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature