Výsledky vyhledávání - "2012 ACM Subject Classification Theory of computation → Graph algorithms analysis"

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs

Autoři: Aubian, Guillaume Brunelli, Filippo Dragan, Feodor, F a další

Přispěvatelé: Aubian, Guillaume Brunelli, Filippo Dragan, Feodor, F a další

Zdroj: https://inria.hal.science/hal-04863343 ; 2025.

Témata: Temporal graphs, Dynamic networks, Time-dependent networks, Fastest temporal path, Fine-grained complexity, 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis, Theory of computation → Shortest paths phrases Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Fine-grained complexity, Theory of computation → Shortest paths phrases Temporal graphs, Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Shortest temporal path Fine-grained complexity, Shortest temporal path, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Dostupnost: https://inria.hal.science/hal-04863343
https://inria.hal.science/hal-04863343v1/document
https://inria.hal.science/hal-04863343v1/file/main-hal.pdf