7 citations · 8 across the 3 of their papers we have counts for
5 papers
Cops & Robber on Periodic Temporal Graphs
Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro +1
We consider the Cops and Robber pursuit-evasion game when the edge-set of the graph is allowed to change in time, possibly at every round. Specifically, the game is played on an in…
Towards a Unified Theory of Time-Varying Data
Benjamin Merlin Bumpus, James Fairbanks, Martti Karvonen +2
What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a gene…
Computing Betweenness Centrality in Link Streams
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Betweeness centrality is one of the most important concepts in graph analysis. It was recently extended to link streams, a graph generalization where links arrive over time. Howeve…
General Cops and Robbers Games with randomness
Frédéric Simard, Josée Desharnais, François Laviolette
Cops and Robbers games have been studied for the last few decades in computer science and mathematics. As in general pursuit evasion games, pursuers (cops) seek to capture evaders…
On computing distances and latencies in Link Streams
Frédéric Simard
Link Streams were proposed a few years ago as a model of temporal networks. We seek to understand the topological and temporal nature of those objects through efficiently computing…