Ball-Shrinking Genetic Search Algorithm for Finding Central Vertices in Graphs

摘要

The paper proposes a genetic algorithm (GA) for finding central vertices in a graph. The algorithm uses a different approach to the method presentation of the solution and describes a new look at the crossover process of GA. The algorithm was compared with existing exact and other genetic algorithms on various random graphs. Empirical results show that this approach can be used in applications and compete with existing algorithms.