Minimum Weight Resolving Sets of Grid Graphs

Patrick Andersen, Cyriac Grigorious, Mirka Miller

For a simple graph $G=(V,E)$ and for a pair of vertices $u,v\in V$, we say that a vertex $w\in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different leng…