Moving clusters within a memetic algorithm for graph partitioning
From MaRDI portal
Publication:1665049
DOI10.1155/2015/238529zbMath1393.05250OpenAlexW2142570667WikidataQ59117687 ScholiaQ59117687MaRDI QIDQ1665049
Inwook Hwang, Yourim Yoon, Yong-Hyuk Kim
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/238529
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quotient geometric crossovers and redundant encodings
- A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation
- Finding good approximate vertex and edge partitions is NP-hard
- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
- Lock-gain based graph partitioning
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Tabu search for graph partitioning
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Multiple-way network partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- Genetic algorithm and graph partitioning
This page was built for publication: Moving clusters within a memetic algorithm for graph partitioning
