Abstract A resolving set S of a graph G is subset its vertices such that no two have the same distance vector to . The Metric Dimension problem asks for minimum size, and in decision form, size at most some specified integer. This NP-complete, remains so very restricted classes graphs. It also W[2]-complete with respect solution. has proven elusive on graphs bounded treewidth. On algorithmic si...