The paper classifies explorability games on static, explicit, and symbolic temporal graphs, proving new PSPACE bounds and introducing a Presburger time-encoding lower-bound technique.
On temporal graph exploration
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Temporal Explorability Games
The paper classifies explorability games on static, explicit, and symbolic temporal graphs, proving new PSPACE bounds and introducing a Presburger time-encoding lower-bound technique.