Introduces temporal beer paths with time-dependent vertices and matching-complexity algorithms for four path variants plus dynamic preprocessing.
7 Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, and Kosuke Sugiyama
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Beer Path Problems in Temporal Graphs
Introduces temporal beer paths with time-dependent vertices and matching-complexity algorithms for four path variants plus dynamic preprocessing.