1 citations · 2 across the 19 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Parameterized Complexity of Temporal Connected Components
Argyrios Deligkas, Michelle Döring, Eduard Eiben +3
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, that is, graphs whose edges are available only at specific points in time.…
cs.DS2025
Temporal Graph Reconfiguration for Always-Connected Graphs
Paul Sievers, George Skretas, Georg Tennigkeit
Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain times, we ar…
cs.DM2025
Temporal Exploration of Random Spanning Tree Models
Samuel Baguley, Andreas Göbel, Nicolas Klodt +3
The Temporal Graph Exploration problem (TEXP) takes as input a temporal graph, i.e., a sequence of graphs on the same vertex set, and asks for a walk of s…