Monitoring the edges of a graph using distances

Florent Foucaud (1) , Ralf Klasing (1) , Mirka Miller , Joe Ryan

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We introduce a new graph-theoretic concept in the area of network monitoring. A set M of vertices of a graph G is a distance-edgemonitoring set if for every edge e of G, there is a vertex x of M and a

Domaines: Informatique [cs]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan. Monitoring the edges of a graph using distances. Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩. ⟨hal-02500423⟩