A genetic algorithm for graph bisection

MaRDI QIDQ5290946zbMATH OpenFDO

Authors N. M. Ershov

Publication date 5 May 2006

zbMATH Keywords

bisection problemcomplexitygenetic algorithmgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 5117494
• Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
• A genetic algorithm for graph partitioning
• Genetic algorithm and graph partitioning
• Speeding up a memetic algorithm for the max-bisection problem

Cited in

(10)

• Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
• Speeding up a memetic algorithm for the max-bisection problem
• A genetic algorithm for graph partitioning
• Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
• Memetic search for the max-bisection problem
• scientific article; zbMATH DE number 5117494 (Why is no real title available?)
• On the graph bisection problem
• Genetic algorithms for drawing bipartite graphs
• Solving the multidimensional maximum bisection problem by a genetic algorithm and variable neighborhood search
• Single- and multi-objective evolutionary algorithms for graph bisectioning

This page was built for publication: A genetic algorithm for graph bisection

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