Computing strong metric dimension of some special classes of graphs by genetic algorithms-Reference-Cited by-同舟云学术

Computing strong metric dimension of some special classes of graphs by genetic algorithms

Published:2008 Issue:2 Volume:18 Page:143-151
ISSN:0354-0243
Container-title:Yugoslav Journal of Operations Research
language:en
Short-container-title:YUGOSLAV J OPERATION

Author:

Kratica Jozef¹,Kovacevic-Vujcic Vera²,Cangalovic Mirjana²

Affiliation:

1. Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade

2. Faculty of Organizational Sciences, Belgrade

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.

Publisher

National Library of Serbia

Subject

Management Science and Operations Research

Reference14 articles.

1. Obtaining test problems via Internet

2. A tree search algorithm for the crew scheduling problem

3. Network Discovery and Verification

4. On the Metric Dimension of Cartesian Products of Graphs

5. Resolvability in graphs and the metric dimension of a graph

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Geodesic Identification of Vertices in Convex Plane Graphs;Mathematical Problems in Engineering;2020-12-27

2. Strong resolving graphs: The realization and the characterization problems;Discrete Applied Mathematics;2018-02

3. The Simultaneous Strong Metric Dimension of Graph Families;Bulletin of the Malaysian Mathematical Sciences Society;2015-11-05

4. Symmetry properties of resolving sets and metric bases in hypercubes;Optimization Letters;2014-09-10

5. Tackling the storage problem through genetic algorithms;Advances in Manufacturing;2014-05-13