Advertisement

On the Complexity of Metric Dimension

  • Josep Díaz
  • Olli Pottonen
  • Maria Serna
  • Erik Jan van Leeuwen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7501)

Abstract

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.

Keywords

Short Path Planar Graph Bifurcation Point Tree Decomposition Dimension Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bailey, R.F., Cameron, P.J.: Base size, metric dimension and other invariants of groups and graphs. Bulletin London Math. Society 43(2), 209–242 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Beerliova, Z., Eberhard, T., Erlebach, T., Hall, A., Hoffmann, M., Mihalak, M., Ram, L.: Network Discovery and Verification. IEEE J. Selected Areas in Communication 24, 2168–2181 (2006)CrossRefGoogle Scholar
  3. 3.
    Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. JACM 41, 153–180 (1994)zbMATHCrossRefGoogle Scholar
  4. 4.
    Bodlaender, H.L.: Classes of Graphs with Bounded Treewidth. Bulletin of the EATCS 36, 116–125 (1988)zbMATHGoogle Scholar
  5. 5.
    Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 194–242. Elsevier Science (1990)Google Scholar
  6. 6.
    Chartrand, G., Eroh, L., Johnson, M.A., Oellemann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Applied Math. 105, 99–113 (2000)zbMATHCrossRefGoogle Scholar
  7. 7.
    Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The Complexity of Multiterminal Cuts. SIAM J. Computing 23, 864–894 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: new connections between FPT algorithms and PTASs. In: SODA 2005, pp. 590–601 (2005)Google Scholar
  9. 9.
    Diestel, R.: Graph Theory. Springer (2000)Google Scholar
  10. 10.
    Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. In: Proc. WG 2012 (to appear, 2012)Google Scholar
  11. 11.
    Erickson, L.H., Carraher, J., Choi, I., Delcourt, M., West, D.B.: Locating a robber on a graph via distance queries (preprint)Google Scholar
  12. 12.
    Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275–291 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Bidimensionality and EPTAS. In: SODA 2011, pp. 748–759 (2011)Google Scholar
  14. 14.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)Google Scholar
  15. 15.
    Harary, F., Melter, R.A.: The metric dimension of a graph. Ars Combinatoria 2, 191–195 (1976)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Hauptmann, M., Schmied, R., Viehmann, C.: On approximation complexity of metric dimension problem. In: J. Discrete Algorithms (2011) (in press)Google Scholar
  17. 17.
    Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. JACM 21, 549–568 (1974)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Johnson, D.S.: Personal communicationGoogle Scholar
  19. 19.
    Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in Graphs. Discrete Applied Math. 70, 217–229 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Lokshtanov, D.: Metric Dimension. In: Demaine, E.D., Hajiaghayi, M.T., Marx, D. (eds.) Open Problems from Dagstuhl Seminar 09511 (2009), http://erikdemaine.org/papers/DagstuhlFPT2009Open/paper.pdf
  21. 21.
    Slater, P.: Leaves of trees. Congressus Numerantium 14, 549–559 (1975)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Josep Díaz
    • 1
  • Olli Pottonen
    • 1
  • Maria Serna
    • 1
  • Erik Jan van Leeuwen
    • 2
  1. 1.Departament de Llenguatges i Sistemes InformaticsUPCBarcelonaSpain
  2. 2.Dept. Computer, Control, Managm. Eng.Sapienza University of RomeItaly

Personalised recommendations