SIAM Journal on Discrete Mathematics · 2017 · 25 citations · 8 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsSet TheoryComputational ComplexityGraph AlgorithmsGraph TheoryMetric GeometryComputational Complexity Of Graph AlgorithmsMetric Graph TheoryPolynomial Time ComplexityPolynomial-time Algorithms
The notion of resolving sets in a graph was introduced by Slater [Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Util. Math., Winnipeg, 1975, pp. 549--559] and Harary and Melter [Ars Combin., 2 (1976), pp. 191--195] as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices $x$ and $y$ there is a vertex in the set which has distinct distances to $x$ and $y$. A smallest resolving set in a graph is called a metric basis and its size, the metric dimension of the graph. The problem of computing the metric dimension of a graph is a well-known NP-hard problem and while it was known to be polynomial time solvable on trees, it is only recently that efforts have been made to understand its computational complexity on various restricted graph classes. In recent work, Foucaud [Algorithmica, 2016, pp. 1--31] showed that this problem is NP-complete even on interval graphs. They complemented this result by also showing that it is fixed-parameter tractable (FPT) parameterized by the metric dimension of the graph. In this work, we show that this FPT result can in fact be extended to all graphs of bounded tree-length. This includes well-known classes like chordal graphs, AT-free graphs, and permutation graphs. We also show that this problem is FPT parameterized by the modular-width of the input graph.
8
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics · 1996 · 808 citations
Tree-decompositions with bags of small diameter
Yon Dourisboure, Cyril Gavoille · Discrete Mathematics · 2006 · 72 citations · Full text