The metric dimension of a graph G is the size of a smallest subset L ⊆ V(G) such that for any x,y ∈ V(G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric dimension of a graph is still very unclear. Essentially, we only know the problem to be NP-hard for general graphs, to be polynomial-time solvable on trees, and to have a logn-approximation algorithm for general graphs. In this paper, we show tight complexity boundaries for the Metric Dimension problem. We achieve this by giving two complementary results. First, we show that the Metric Dimension problem on bounded-degree planar graphs is NP-complete. Then, we give a polynomial-time algorithm for determining the metric dimension of outerplanar graphs. © 2012 Springer-Verlag.
CITATION STYLE
Díaz, J., Pottonen, O., Serna, M., & Van Leeuwen, E. J. (2012). On the complexity of metric dimension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7501 LNCS, pp. 419–430). https://doi.org/10.1007/978-3-642-33090-2_37
Mendeley helps you to discover research relevant for your work.