The complexity of -Metric Dimension has only been investigated for very few graph classes, such as trees and other simple graph classes. For general graph classes, -Metric Dimension is assumed to be NP-complete if is given as part of the input.
Nov 15, 2023
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 ...
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 ...
Dec 5, 2024 · In this paper, we show tight complexity boundaries for the Metric Dimension problem. We achieve this by giving two complementary results. First, ...
Jan 28, 2021 · The decision problem k-Metric Dimension is the question whether G has a k-resolving set of size at most r, for a given graph G and a given ...
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 ...
People also ask
What is a metric dimension?
What is metric dimension application?
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 ...
Jan 28, 2021 · For general graph classes, k-Metric Dimension is assumed to be NP-complete if k is given as part of the input.
We study some problems regarding the complexity of some $k$-metric dimension problems. For instance, we show that the problem of computing the $k$-metric ...
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 ...