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.
No takes yet. Share an insight, caveat, or question.
Tillquist et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: