J Baste, F Beggas, H Kheddouci,
I Sau - Information Processing Letters, 2017 - Elsevier
In a graph G=(V, E), a vertex v∈ V monitors an edge {u, u′}∈ E if {v, u}∈ E and {v, u′}∈
E. Given an n-vertex graph G=(V, E), in which each edge is contained in at least one …