Výsledky vyhľadávania - "2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration"

The Shortest Temporal Exploration Problem

Autori: Balev, Stefan Sanlaville, Eric Toullalan, Antoine a ďalší

Prispievatelia: Balev, Stefan Sanlaville, Eric Toullalan, Antoine a ďalší

Zdroj: https://normandie-univ.hal.science/hal-05020820 ; LITIS, Le Havre Normandie University. 2025.

Predmety: Temporal graph, Graph exploration, Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration Graph Theory Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://normandie-univ.hal.science/hal-05020820
https://normandie-univ.hal.science/hal-05020820v1/document
https://normandie-univ.hal.science/hal-05020820v1/file/STEXP_Balev_Sanlaville_Toullalan.pdf
https://doi.org/10.4230/LIPIcs

The Shortest Temporal Exploration Problem

Autori: Balev, Stefan Sanlaville, Éric Toullalan, Antoine a ďalší

Prispievatelia: Balev, Stefan Sanlaville, Éric Toullalan, Antoine a ďalší

Zdroj: https://normandie-univ.hal.science/hal-05020820 ; LITIS, Le Havre Normandie University. 2025.

Predmety: Temporal graph, Graph exploration, Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration Graph Theory Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://normandie-univ.hal.science/hal-05020820
https://normandie-univ.hal.science/hal-05020820v1/document
https://normandie-univ.hal.science/hal-05020820v1/file/STEXP_Balev_Sanlaville_Toullalan.pdf
https://doi.org/10.4230/LIPIcs