The complexity of computing optimum labelings for temporal connectivity

DOI10.4230/LIPICS.MFCS.2022.62MaRDI QIDQ6584065zbMATH OpenFDO

Authors Nina Klobas, George B. Mertzios, Hendrik Molter, P. G. Spirakis

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.62

zbMATH Keywords

foremost temporal pathgraph labelingSteiner treetemporal connectivitytemporal graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Temporal reachability minimization: delaying vs. deleting
• The complexity of computing optimum labelings for temporal connectivity
• Temporalizing digraphs via linear-size balanced bi-trees
• Temporal graph realization from fastest paths
• Parameterized algorithms for multi-label periodic temporal graph realization

This page was built for publication: The complexity of computing optimum labelings for temporal connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584065)