Abstract
The metric dimension has been introduced independently by Harary, Melter [11] and Slater [15] in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such that, for every pair (u, v) of vertices of G, there is a vertex x in X such that the distance between x and u and the distance between x and v are distinct. The metric dimension of the graph is the minimum size of a resolving set. Computing the metric dimension of a graph is NP-hard even on split graphs and interval graphs. Bonnet and Purohit [2] proved that the metric dimension problem is W[1]-hard parameterized by treewidth. Li and Pilipczuk strengthened this result by showing that it is NP-hard for graphs of treewidth 24 in [14]. In this article, we prove that metric dimension is FPT parameterized by treewidth in chordal graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The addition of a single edge in a graph might modify the metric dimension by \(\varOmega (n)\), see e.g. [7].
References
Belmonte, R., Fomin, F.V., Golovach, P.A., Ramanujan, M.S.: Metric dimension of bounded tree-length graphs. CoRR abs/1602.02610 (2016)
Bonnet, É., Purohit, N.: Metric dimension parameterized by treewidth. Algorithmica 83(8), 2606–2633 (2021)
Chartrand, G., Lesniak, L., Zhang, P.: Graphs and Digraphs, 6th edn. Chapman and Hall/CRC (2015)
Díaz, J., Pottonen, O., Serna, M., van Leeuwen, E.J.: On the complexity of metric dimension. In: Epstein, L., Ferragina, P. (eds.) Algorithms - ESA 2012 (2012)
Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 25, 71–76 (1961). https://doi.org/10.1007/BF02992776
Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4), 1130–1171 (2015)
Eroh, L., Feit, P., Kang, C.X., Yi, E.: The effect of vertex or edge deletion on the metric dimension of graphs. J. Comb 6(4), 433–444 (2015)
Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78(3), 914–944 (2017)
Garey, J.: A guide to the theory of NP-completeness. J. Algorithms (1979)
Gima, T., Hanaka, T., Kiyomi, M., Kobayashi, Y., Otachi, Y.: Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918, 60–76 (2022)
Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combinatoria 2, 191–195 (1975)
Hartung, S., Nichterlein, A.: On the parameterized and approximation hardness of metric dimension. In: 2013 IEEE Conference on Computational Complexity, pp. 266–276. IEEE (2013)
Kloks, T.: Treewidth: Computations and Approximations. Springer, Heidelberg (1994)
Li, S., Pilipczuk, M.: Hardness of metric dimension in graphs of constant treewidth. Algorithmica 84(11), 3110–3155 (2022)
Slater, P.J.: Leaves of trees. Congressus Numerantium 14 (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bousquet, N., Deschamps, Q., Parreau, A. (2023). Metric Dimension Parameterized by Treewidth in Chordal Graphs. In: Paulusma, D., Ries, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2023. Lecture Notes in Computer Science, vol 14093. Springer, Cham. https://doi.org/10.1007/978-3-031-43380-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-43380-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43379-5
Online ISBN: 978-3-031-43380-1
eBook Packages: Computer ScienceComputer Science (R0)