Temporal graph realization from fastest paths

DOI10.1016/J.TCS.2025.115508MaRDI QIDQ6903544zbMATH OpenFDO

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

Publication date 10 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parameterized complexitygraph realizationtemporal graphtemporal connectivityfastest temporal pathperiodic temporal labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Temporal graph realization from fastest paths

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