Multistage s-t Path: Confronting Similarity with Dissimilarity

@inproceedings{Fluschnik2020MultistageSP,
  title={Multistage s-t Path: Confronting Similarity with Dissimilarity},
  author={Till Fluschnik and R. Niedermeier and Carsten Schubert and Philipp Zschoche},
  booktitle={ISAAC},
  year={2020}
}
Addressing a quest by Gupta et al. [ICALP'14], we provide a first, comprehensive study of finding a short s-t path in the multistage graph model, referred to as the Multistage s-t Path problem. Herein, given a sequence of graphs over the same vertex set but changing edge sets, the task is to find short s-t paths in each graph ("snapshot") such that in the found path sequence the consecutive s-t paths are "similar". We measure similarity by the size of the symmetric difference of either the… Expand
Multistage Vertex Cover
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints
Comparing temporal graphs using dynamic time warping
Comparing Temporal Graphs Using Dynamic Time Warping
A Multistage View on 2-Satisfiability
Multistage Committee Election
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

References

SHOWING 1-10 OF 40 REFERENCES
Multistage Vertex Cover
LP-based algorithms for multistage minimization problems
Multistage Problems on a Global Budget
How to Find Long Paths Efficiently
Shortest Paths in Multiplex Networks
The parameterized complexity of the minimum shared edges problem
...
1
2
3
4
...