On the convergence rate of annealing processes
SIAM Journal on Control and Optimization
ACM Transactions on Mathematical Software (TOMS)
Multiple-Way Network Partitioning
IEEE Transactions on Computers
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Computing
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
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
TimberWolf3.2: a new standard cell placement and global routing package
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Geometric mesh partitioning: implementation and experiments
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Partioning of Unstructed Meshes for Load Balancing
Partioning of Unstructed Meshes for Load Balancing
Efficient and effective placement for very large circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Reactive Search for Traffic Grooming in WDM Networks
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Lock-Gain Based Graph Partitioning
Journal of Heuristics
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study
Journal of Heuristics
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs
IEEE Transactions on Computers
Partitioning finite element meshes using space-filling curves
Future Generation Computer Systems - Special issue: Parallel computing technologies
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
Geometric crossover for multiway graph partitioning
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A PROBE-Based Heuristic for Graph Partitioning
IEEE Transactions on Computers
Geometric crossovers for multiway graph partitioning
Evolutionary Computation
An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Reactive and dynamic local search for max-clique: Engineering effective building blocks
Computers and Operations Research
Partitioning finite element meshes using space-filling curves
Future Generation Computer Systems - Special issue: Parallel computing technologies
Problem-independent schema synthesis for genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Investigation of the fitness landscapes and multi-parent crossover for graph bipartitioning
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
An effective multilevel tabu search approach for balanced graph partitioning
Computers and Operations Research
Graph partitioning strategies for efficient BFS in shared-nothing parallel systems
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
iRedistrict: Geovisual analytics for redistricting optimization
Journal of Visual Languages and Computing
Performance of a genetic algorithm for the graph partitioning problem
Mathematical and Computer Modelling: An International Journal
Spatial awareness in robotic swarms through local wireless communications
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 14.99 |
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate tie-breaking rule (Min-Max-Greedy) produces initial assignments in a very fast time. For some classes of graphs, independent repetitions of Min-Max-Greedy are sufficient to reproduce solutions found by more complex techniques. When the method is not competitive, the initial assignments are used as starting points for a prohibition-based scheme, where the prohibition is chosen in a randomized and reactive way, with a bias towards more successful choices in the previous part of the run. The relationship between prohibition-based diversification (Tabu Search) and the variable-depth Kernighan-Lin algorithm is discussed. Detailed experimental results are presented on benchmark suites used in the previous literature, consisting of graphs derived from parametric models (random graphs, geometric graphs, etc.) and of 驴real-world驴 graphs of large size. On the first series of graphs, a better performance for equivalent or smaller computing times is obtained, while, on the large 驴real-world驴 instances, significantly better results than those of multilevel algorithms are obtained, but for a much larger computational effort.