Abstract | ||
---|---|---|
In this paper, we study the edge metric dimension problem (EMDP). We establish a potential function and give a corresponding greedy algorithm with approximation ratio 1 + lnn + ln(log(2) n), where nis the number of vertices in the graph G. (C) 2020 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
---|---|---|
2021 | 10.1016/j.tcs.2020.05.005 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
Edge metric generator, Edge metric dimension, Approximation algorithms, Submodular function | Journal | 853 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yufei Huang | 1 | 31 | 4.08 |
Bo Hou | 2 | 1 | 2.39 |
Wen Liu | 3 | 8 | 3.34 |
Wu Lidong | 4 | 120 | 13.49 |
Stephen Rainwater | 5 | 1 | 0.70 |
Suogang Gao | 6 | 59 | 12.78 |