activity
20122026
most citedDetecting and Enumerating Small Induced Subgraphs in -Closed Graphs

1 citations · 2 across the 11 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019

Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints

Anne-Sophie Himmel, Matthias Bentert, André Nichterlein +1

Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed ve…