Authors: Kratica, Jozef 
Kovacevic-Vujčić, Vera
Čangalović, Mirjana
Title: Computing strong metric dimension of some special classes of graphs by genetic algorithms
Journal: Yugoslav Journal of Operations Research
Volume: 18
Issue: 2
First page: 143
Last page: 151
Issue Date: 1-Jan-2008
ISSN: 0354-0243
DOI: 10.2298/YJOR0802143K
Abstract: 
In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem. This represents the first attempt to solve this problem heuristically. We report experimental results for the two special classes of ORLIB test instances: crew scheduling and graph coloring.
Keywords: Evolutionary approach | Genetic algorithms | Strong metric dimension
Project: Faculty of Organizational Sciences, University of Belgrade
Serbian Ministry of Science, Grant no. 144015G

Show full item record

SCOPUSTM   
Citations

23
checked on Aug 17, 2022

Page view(s)

20
checked on Aug 18, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.