Metric dimension parameterized by treewidth in chordal graphs - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 2023

Metric dimension parameterized by treewidth in chordal graphs

Résumé

The metric dimension has been introduced independently by Harary, Melter [HM75] and Slater [Sla75] 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 [BP21] proved that the metric dimension problem is W[1]-hard parameterized by treewidth. Li and Pilipczuk strenghtened this result by showing that it is NP-hard for graphs of treewidth 24 in [LP22]. In this article, we prove that metric dimension is FPT parameterized by treewidth in chordal graphs.
Fichier principal
Vignette du fichier
2_trees (1).pdf (390.87 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04154690 , version 1 (06-07-2023)

Identifiants

Citer

Nicolas Bousquet, Quentin Deschamps, Aline Parreau. Metric dimension parameterized by treewidth in chordal graphs. Graph-Theoretic Concepts in Computer Science: 49th International Workshop, WG 2023, 14093, Springer Nature Switzerland; Springer Nature Switzerland, pp.130-142, 2023, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-43380-1_10⟩. ⟨hal-04154690⟩
22 Consultations
32 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More