The (weighted) metric dimension of graphs: hard and easy cases

摘要

Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. The authors tend to simplify these polynomial-time algorithms.