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

zbMATH Keywords

Steiner treegraph labelingtemporal graphtemporal connectivityforemost temporal path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Temporal reachability minimization: delaying vs. deleting
• The complexity of computing optimum labelings for temporal connectivity

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)