A temporal graph in which every edge appears at least once every F timesteps can be explored in F(2n-3) steps, and this is tight up to an additive constant.
Traveling salesman problems in temporal graphs.Theoretical Computer Science, 2016.634:1–23
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Exploring Temporal Graphs with Frequent and Regular Edges
A temporal graph in which every edge appears at least once every F timesteps can be explored in F(2n-3) steps, and this is tight up to an additive constant.