Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A general framework for vertex orderings, with applications to netlist clustering
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Lock-Gain Based Graph Partitioning
Journal of Heuristics
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study
Journal of Heuristics
A fast kernel-based multilevel algorithm for graph clustering
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
Multi-attractor gene reordering for graph bisection
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
A Fast Algorithm for Balanced Graph Clustering
IV '07 Proceedings of the 11th International Conference Information Visualization
Geometric crossovers for multiway graph partitioning
Evolutionary Computation
A Graph Clustering Algorithm Based on Minimum and Normalized Cut
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Computer Science Review
Edge separability-based circuit clustering with application to multilevel circuit partitioning
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Finding optimal solutions in the graph bisection problem is a notoriously hard task. One of the main reasons is the barriers which prevent search algorithms from reaching the optimal solutions. Given an algorithm for finding optimal solutions, the search process can be represented by a Markov chain. Every two neighboring solutions has a connection in the chain with a transition probability. If the algorithm is deterministic, many of the connections are set to the probability zero since they can never be chosen in the algorithm. It thus may happen that there is no path with a positive probability. We suggest a method to open paths with zero or near-zero transition probability by implicitly changing the chain, which we believe will eventually make the search more flexible. Experimental results showed significant improvement over traditional representative partitioning methodologies, the Fiduccia-Mattheyses algorithm and its two-phase variant.