# Landmarks in graphs

Title | Landmarks in graphs |

Publication Type | Journal Articles |

Year of Publication | 1996 |

Authors | Khuller S, Raghavachari B, Rosenfeld A |

Journal | Discrete Applied Mathematics |

Volume | 70 |

Issue | 3 |

Pagination | 217 - 229 |

Date Published | 1996/10/08/ |

ISBN Number | 0166-218X |

Abstract | Navigation can be studied in a graph-structured framework in which the navigating agent (which we shall assume to be a point robot) moves from node to node of a “graph space”. The robot can locate itself by the presence of distinctively labeled “landmark” nodes in the graph space. For a robot navigating in Euclidean space, visual detection of a distinctive landmark provides information about the direction to the landmark, and allows the robot to determine its position by triangulation. On a graph, however, there is neither the concept of direction nor that of visibility. Instead, we shall assume that a robot navigating on a graph can sense the distances to a set of landmarks.Evidently, if the robot knows its distances to a sufficiently large set of landmarks, its position on the graph is uniquely determined. This suggests the following problem: given a graph, what are the fewest number of landmarks needed, and where should they be located, so that the distances to the landmarks uniquely determine the robot's position on the graph? This is actually a classical problem about metric spaces. A minimum set of landmarks which uniquely determine the robot's position is called a “metric basis”, and the minimum number of landmarks is called the “metric dimension” of the graph. In this paper we present some results about this problem. Our main new results are that the metric dimension of a graph with n nodes can be approximated in polynomial time within a factor of O(log n), and some properties of graphs with metric dimension two. |

URL | http://www.sciencedirect.com/science/article/pii/0166218X95001062 |

DOI | 10.1016/0166-218X(95)00106-2 |