A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

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

Résumé

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 increasing edge time labels. We consider the problem of assigning time labels to the edges of a digraph in order to maximize the total reachability of the resulting temporal graph (that is, the number of pairs of nodes which are connected one to the other). In particular, we prove that this problem is NP-hard. We then conjecture that the problem is approximable within a constant approx- imation ratio. This conjecture is a consequence of the following graph theoretic conjecture: any strongly connected directed graph with n nodes admits an out-arborescence and an in-arborescence that are edge-disjoint, have the same root, and each spans Ω(n) nodes.
Fichier principal
Vignette du fichier
main.pdf (304.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04054527 , version 1 (31-03-2023)

Identifiants

Citer

Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot. A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. 2023. ⟨hal-04054527⟩
16 Consultations
28 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More