Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Modern heuristic techniques for combinatorial problems
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
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
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 Mixed Heuristic for Circuit Partitioning
Computational Optimization and Applications
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Normalized Cuts and Image Segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
An effective multi-level algorithm based on ant colony optimization for bisecting graph
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
An effective multi-level algorithm for bisecting graph
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An effective refinement algorithm based on swarm intelligence for graph bipartitioning
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
Future Generation Computer Systems
| Hi-index | 0.00 |
Partitioning is a fundamental problem in diverse fields of study such as knowledge discovery, data mining, image segmentation and grouping. 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 simulated annealing for bisecting graph. The success of our algorithm relies on exploiting both the simulated annealing procedure 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.