Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Capturing an Invisible Robber using Separators
Igor Potapov, Tymofii Prokopenko, John Sylvester
We study the zero-visibility cops and robbers game, where the robber is invisible to the cops until they are caught. This differs from the classic game where full information about…
cs.DM2024
A New Temporal Interpretation of Cluster Editing
Cristiano Bocci, Chiara Capresi, Kitty Meeks +1
The NP-complete graph problem Cluster Editing seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the edges. We introduce a na…