Suchergebnisse - "Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2"

Brief Announcement : The Shortest Temporal Exploration Problem

Autoren: Balev, Stefan Sanlaville, Éric Toullalan, Antoine et al.

Weitere Verfasser: Balev, Stefan Sanlaville, Éric Toullalan, Antoine et al.

Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND) ; https://normandie-univ.hal.science/hal-05283832 ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND), Jun 2025, LIVERPOOL, United Kingdom. ⟨10.4230/LIPIcs.SAND.2025.2⟩

Schlagwörter: Mathematics of computing → Graph theory, Temporal Graph Exploration, Graph Theory, Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory Temporal Graph Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Geographisches Schlagwort: LIVERPOOL, United Kingdom

Verfügbarkeit: https://normandie-univ.hal.science/hal-05283832
https://normandie-univ.hal.science/hal-05283832v1/document
https://normandie-univ.hal.science/hal-05283832v1/file/LIPIcs.SAND.2025.18.pdf
https://doi.org/10.4230/LIPIcs.SAND.2025.2