• DOI:10.1007/978-3-030-36683-4_40
Corpus ID: 202537868

Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints

@inproceedings{Himmel2019EfficientCO,
  title={Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints},
  author={A. Himmel and M. Bentert and A. Nichterlein and R. Niedermeier},
  booktitle={COMPLEX NETWORKS},
  year={2019}
}

A. Himmel, M. Bentert, +1 author R. Niedermeier

Published in COMPLEX NETWORKS 2019

Computer Science

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 vertex sets but edge sets changing over time. Taking into account the temporal aspect leads to a rich set of optimization criteria for "shortest" walks. Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide an algorithm for computing optimal walks that is capable to deal… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed