Abstract
This paper studies a genetic algorithm for finding the central vertices in graphs. The algorithm uses a different approach to the solution method presentation and describes a new insight in the crossover process. Studies are conducted to find the optimal parameters of the genetic algorithm such us crossover probability, mutation probability and population size. Based on the results, it can be claimed that with the right parameters, our algorithm shows good running time results with high accuracy of the correct answers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
