Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling

DOI10.3724/SP.J.1087.2008.02850MaRDI QIDQ3399658zbMATH OpenOpenAlexFDO

Authors Benda Zhou, Minghua Chen, Zhe Ren

Publication date 12 October 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.02850

zbMATH Keywords

Genetic Algorithm (GA)2-way graph partitioninggenetic algorithm based on uniform design sampling (UGA)Uniform Design Sampling (UDS)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Genetic algorithm and graph partitioning
• Genetic algorithm based on random uniform design
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
• Performance of a genetic algorithm for the graph partitioning problem
• A genetic algorithm for graph partitioning

Cited in

(1)

• Genetic algorithm based on random uniform design

This page was built for publication: Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399658)