7 citations · 8 across the 7 of their papers we have counts for
12 papers · 1 filter
Temporal Graph Realization With Bounded Stretch
George B. Mertzios, Hendrik Molter, Nils Morawietz +1
A periodic temporal graph, in its simplest form, is a graph in which every edge appears exactly once in the first time steps, and then it reappears recurrently every time s…
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…
The complexity of computing optimum labelings for temporal connectivity
Nina Klobas, George B. Mertzios, Hendrik Molter +1
A graph is temporally connected if there exists a strict temporal path, i.e. a path whose edges have strictly increasing labels, from every vertex to every other vertex . In…
Delay-Robust Routes in Temporal Graphs
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodi…
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficul…
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Maciej Rymar, Hendrik Molter, André Nichterlein +1
In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality…