Shaily Verma

Reconfiguration of Temporal Networks under Reachability Constraints

This work formalizes the time label reconfiguration problem and provides a theoretical framework for reasoning about transformation processes in temporal networks and shows that if the static graph is acyclic or an almost-tournament graph, then all valid labelings can be reconfigured into each other.