Articles by Antoine Dailly

Algorithms for the Metric Dimension problem on directed graphs

-- Antoine Dailly (LIMOS, Clermont-Ferrand)

summary: In graph theory, the Metric Dimension problem is the following: we are looking for a minimum-size set R of vertices, such that for any pair of vertices of the graph, there is a vertex from R whose two distances to the vertices of the pair are distinct. This problem ...