# Computing the metric dimension by decomposing graphs into extended biconnected components

A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for G, if for every two distinct vertices u,v ∈ V there is a vertex w ∈ U such that the distances between u and w and the distance between v and w are different. The Metric Dimension of G is the size of a smallest resolving set for G. Deciding whether a given graph G has Metric Dimension at most k for some integer k is well-known to be NP-complete. Many research has been done to understand the complexity of this problem on restricted graph classes. In this paper, we decompose a graph into its so called extended biconnected components and present an efficient algorithm for computing the metric dimension for a class of graphs having a minimum resolving set with a bounded number of vertices in every extended biconnected component. Further we show that the decision problem METRIC DIMENSION remains NP-complete when the above limitation is extended to usual biconnected components.

• 3 publications
• 9 publications
• 7 publications
research
01/28/2021

### A note on the complexity of k-Metric Dimension

Two vertices u, v ∈ V of an undirected connected graph G=(V,E) are resol...
research
03/13/2023

### Complexity and equivalency of multiset dimension and ID-colorings

This investigation is firstly focused into showing that two metric param...
research
06/08/2023

### Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem

We consider an inverse problem for a finite graph (X,E) where we are giv...
research
10/09/2017

### Computing metric hulls in graphs

We prove that, given a closure function the smallest preimage of a close...
research
02/12/2023

### Computing Truncated Metric Dimension of Trees

Let G=(V,E) be a simple, unweighted, connected graph. Let d(u,v) denote ...
research
09/21/2022

### The Dispersive Art Gallery Problem

We introduce a new variant of the art gallery problem that comes from sa...
research
06/25/2023

### Estimating Network Dimension When the Spectrum Struggles

What is the dimension of a network? Here, we view it as the smallest dim...