Showing cs.DSShow 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
Finding Minimum Distance Preservers: A Parameterized Study
Kirill Simonov, Farehe Soheil, Shaily Verma
For a given graph and a subset of vertices , a \emph{distance preserver} is a subgraph of that preserves shortest paths between the vertices of . We distinguish betwe…