A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
Alkida BalliuFilippo BrunelliPierluigi CrescenziDennis OlivettiLaurent ViennotPublished in: CoRR (2023)
Keyphrases
- directed graph
- disjoint paths
- undirected graph
- strongly connected
- random walk
- directed acyclic graph
- spatio temporal
- transitive closure
- edge detection
- edge detector
- temporal information
- space time
- temporal data
- approximation algorithms
- maximum flow
- temporal databases
- spanning tree
- edge information
- temporal reasoning
- neural network
- spatial and temporal
- special case
- multiscale