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

DOI

10.2991/ahcs.k.191206.017How to use a DOI?

Keywords

Genetic algorithm, Graph models, Central node, Central vertices, Large graphs

Abstract

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.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Andrew Vlasov
AU  - Andrew Khomchenko
AU  - Alexey Faizliev
AU  - Sergei Mironov
PY  - 2019
DA  - 2019/12/12
TI  - Ball-Shrinking Genetic Search Algorithm for Finding Central Vertices in Graphs
BT  - Proceedings of the Fourth Workshop on Computer Modelling in Decision Making (CMDM 2019)
PB  - Atlantis Press
SP  - 94
EP  - 97
SN  - 2589-4900
UR  - https://doi.org/10.2991/ahcs.k.191206.017
DO  - 10.2991/ahcs.k.191206.017
ID  - Vlasov2019
ER  -