2011 · 86 citations · 61 references
ComputingComputer ScienceOptimizationParallel AlgorithmsParallel ComputingCommunity DetectionCrossover OperatorsData PartitioningGenetic AlgorithmsGraph AlgorithmsGraph TheoryGenetic Algorithm OptimizationGraph PartitioningPartitioning AlgorithmsPartitioning Problems
The graph partitioning problem occurs in numerous applications such as circuit placement, matrix factorization, load balancing, and community detection. For this problem, genetic algorithm is a representative approach with competitive performance with many related papers being published. Although there are a number of surveys on graph partitioning, none of them deals with genetic algorithms in much detail. In this survey, a number of problem-specific issues in applying genetic algorithms to the graph partitioning problem are discussed; the issues include encoding, crossover, normalization, and balancing.
61
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
Introduction to parallel computing
Choice Reviews Online · 2004 · 1.9K citations