Restless reachability in temporal graphs

Suhas Thejaswi
Suhas Thejaswi
Cited by: 0|Bibtex|Views8
Other Links: arxiv.org

Abstract:

We study a family of temporal reachability problems under waiting-time restrictions. In particular, given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, and such that the difference in timestamps between consecutive edges is at most a resting time. ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments