Computing the metric dimension by decomposing graphs into extended biconnected components

Duygu Vietz, Stefan Hoffmann, Egon Wanke

A vertex set $U\subseteq V$ of an undirected graph $G=(V,E)$ is a $\text{resolving set}$ for $G$, if for every two distinct vertices $u,v\in V$ there is a vertex $w\in U$ such…