Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
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
Bipartite graph partitioning and data clustering
Proceedings of the tenth international conference on Information and knowledge management
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
An effective multi-level algorithm for bisecting graph
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
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
A New Multi-level Algorithm Based on Particle Swarm Optimization for Bisecting Graph
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
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
Cutting graphs using competing ant colonies and an edge clustering heuristic
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Edge detection of laser range image based on a fast adaptive ant colony algorithm
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
Future Generation Computer Systems
| Hi-index | 0.01 |
An important application of graph partitioning is data clustering using a graph model -- the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. The min-cut bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level algorithm based on ant colony optimization(ACO) for bisecting graph. The success of our algorithm relies on exploiting both the ACO method and the concept of the graph core. Our experimental evaluations on 18 different graphs show that our algorithm produces encouraging solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature.