1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
Tom Davot, Jessica Enright, Jayakrishnan Madathil +1
A graph G is c-closed if every two vertices with at least c common neighbors are adjacent to each other. Introduced by Fox, Roughgarden, Seshadhri, Wei and Wein [ICALP 2018, SICOMP…
Reachability in temporal graphs under perturbation
Jessica Enright, Laura Larios-Jones, Kitty Meeks +1
Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors i…
Structural Parameters for Dense Temporal Graphs
Jessica Enright, Samuel D. Hand, Laura Larios-Jones +1
Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has…