42 citations · 75 across the 11 of their papers we have counts for
5 papers · 1 filter
Perturbation results for distance-edge-monitoring numbers
Chenxu Yang, Ralf Klasing, Changxiang He +1
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Given a graph , a set $M \subseteq V(…
The RED-BLUE SEPARATION problem on graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud +2
We introduce the Red-Blue Separation problem on graphs, where we are given a graph whose vertices are colored either red or blue, and we want to select a (small) subset $…
Monitoring the edges of product networks using distances
Wen Li, Ralf Klasing, Yaping Mao +1
Foucaud {\it et al.} recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Let be a graph with vertex set , …
On the size of identifying codes in triangle-free graphs
Florent Foucaud, Ralf Klasing, Adrian Kosowski +1
In an undirected graph , a subset such that is a dominating set of , and each vertex in is dominated by a distinct subset of vertices from , i…
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gasieniec +7
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…