This paper applies different Genetic Algorithms in solving GP problem. In addition to using the Simple Genetic Algorithm (SGA), it introduces a new genetic ...

In this paper, we present classical and new encoding representations for the unsupervised graph partitioning problem.

This paper presents new techniques for discovering more than one solution to this problem using genetic algorithms. The techniques used are based upon applying ...

Jul 19, 2023 · In this paper, we investigate the impact of modifying the size of the chromosomes on the edge based GA by reducing the GPP edge set.

Dec 4, 2019 · This paper considers the problem of partitioning large graphs. We propose a genetic algorithm to distribute large-scale graphs for parallel ...

The Graph Partitioning Problem (GPP) is one of the fundamental multimodal, combinatorial problems that has many applications in computer science. Many.

This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude ...

Abstract. The Graph Partitioning Problem (GPP) is one of the fundamental multimodal combinatorial problems that has many applications in computer science.

We consider several approaches for solving partitioning problems with genetic algorithms. Two test problems are used to evaluate the approaches.

This paper addresses the problem of partitioning a graph and particular the use of the genetic algorithms for graph partitioning. It is a NP hard problem.