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
    8 Citations

    Figures, Tables, and Topics from this paper

    The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
    • 14
    • PDF
    Algorithmic Aspects of Temporal Betweenness
    • 2
    • PDF
    Restless reachability problems in temporal graphs.
    • PDF
    Restless reachability in temporal graphs
    • 1
    As Time Goes By: Reflections on Treewidth for Temporal Graphs
    • PDF
    Betweenness centrality for temporal multiplexes
    • PDF

    References

    SHOWING 1-10 OF 43 REFERENCES
    Efficient computation of optimal temporal walks under waiting-time constraints
    • 3
    The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
    • 14
    • PDF
    Temporal Network Optimization Subject to Connectivity Constraints
    • 33
    • PDF
    Algorithmic Aspects of Temporal Betweenness
    • 2
    • PDF
    Connectivity and inference problems for temporal networks
    • 220
    • PDF
    Graph Metrics for Temporal Networks
    • 171
    • PDF
    Algorithms for minimum-cost paths in time-dependent networks with waiting policies
    • B. Dean
    • Computer Science
    • Networks
    • 2004
    • 87
    • Highly Influential
    • PDF
    Mapping temporal-network percolation to weighted, static event graphs
    • 17
    • PDF