Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Reconfiguration of Temporal Networks under Reachability Constraints
Othon Michail, George Skretas, Georg Tennigkeit +1
Temporal networks model dynamic systems in which edges represent interactions and labels specify when these interactions occur. Examples include transportation networks, time-sensi…
cs.DS2026
Maximizing Reachability via Shifting of Temporal Paths
Argyrios Deligkas, Michelle Döring, Eduard Eiben +2
We examine the problem of maximizing the reachability of a given source in temporal graphs that are given as the union of k temporal paths, i.e., every given path is a sequence of…