research
∙
04/03/2023
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs
A temporal graph is a graph in which edges are assigned a time label. Tw...
share
research
∙
11/22/2022
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time
In a temporal graph, each edge is available at specific points in time. ...
research
∙
11/16/2021
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation
We consider the problem of assigning appearing times to the edges of a d...
research
∙
01/06/2021