collaborators

1 paper

cs.DS2023

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs

Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi +2

A temporal graph is a graph in which edges are assigned a time label. Two nodes u and v of a temporal graph are connected one to the other if there exists a path from u to v with i…