9 citations · 47 across the 26 of their papers we have counts for
Showing 2019 · cs.DMShow all
2 papers · 2 filters
cs.DM2019
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter +1
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, grap…
cs.DM2019★ 2 cited
Computing Maximum Matchings in Temporal Graphs
George B. Mertzios, Hendrik Molter, Rolf Niedermeier +2
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph , a temporal graph is represented by assigning a set of integ…