Metric Dimension Parameterized by Treewidth

07/18/2019
by   Édouard Bonnet, et al.
0

A resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polytime algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time f(pw)n^o(pw) on n-vertex graphs of constant degree, with pw the pathwidth of the input graph, and f any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. [SIAM J. Discrete Math. '17] with respect to the combined parameter tl+Δ, where tl is the tree-length and Δ the maximum-degree of the input graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2023

Metric dimension parameterized by treewidth in chordal graphs

The metric dimension has been introduced independently by Harary, Melter...
research
01/30/2023

The Leafed Induced Subtree in chordal and bounded treewidth graphs

In the Fully Leafed Induced Subtrees, one is given a graph G and two int...
research
02/14/2022

Problems hard for treewidth but easy for stable gonality

We show that some natural problems that are XNLP-hard (which implies W[t...
research
05/04/2023

On the parameterized complexity of the Perfect Phylogeny problem

This paper categorizes the parameterized complexity of the algorithmic p...
research
11/09/2018

Minimizing and Computing the Inverse Geodesic Length on Trees

The inverse geodesic length (IGL) of a graph G=(V,E) is the sum of inver...
research
06/22/2022

Dispersing Obnoxious Facilities on Graphs by Rounding Distances

We continue the study of δ-dispersion, a continuous facility location pr...
research
10/13/2022

On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy

In 2021, Duarte, Oliveira, and Souza [MFCS 2021] showed some problems th...

Please sign up or login with your details

Forgot password? Click here to reset