3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2023★ 3 cited
On Computing Large Temporal (Unilateral) Connected Components
Isnard Lopes Costa, Raul Lopes, Andrea Marino +1
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, . Paths are sequences of adjacent edges whose appearing times are ei…
cs.DM2023
Snapshot disjointness in temporal graphs
Allen Ibiapina, Ana Silva
In the study of temporal graphs, only paths respecting the flow of time are relevant. In this context, many concepts of walks disjointness were proposed over the years, and the val…