Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Realizing temporal transportation trees
George B. Mertzios, Hendrik Molter, Nils Morawietz +1
In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constr…
cs.DS2025
The Complexity of Transitively Orienting Temporal Graphs
George B. Mertzios, Hendrik Molter, Malte Renken +2
In a temporal network with discrete time-labels on its edges, entities and information can only ``flow'' along sequences of edges whose time-labels are non-decreasing (resp. increa…
cs.DS2024
Realizing temporal graphs from fastest travel times
Nina Klobas, George B. Mertzios, Hendrik Molter +1
In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal gra…