  In this manuscript, we provide a concise review of the concept of metric
dimension for both deterministic as well as random graphs. Algorithms to
approximate this quantity, as well as potential applications, are also
reviewed. This work has been partially funded by the NSF IIS grant 1836914.
