7 citations · 7 across the 7 of their papers we have counts for
Showing 2020 · cs.DMShow all
2 papers · 2 filters
cs.DM2020
Sharp Thresholds in Random Simple Temporal Graphs
Arnaud Casteigts, Michael Raskin, Malte Renken +1
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is c…
cs.DM2020
Feedback Edge Sets in Temporal Graphs
Roman Haag, Hendrik Molter, Rolf Niedermeier +1
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provid…