2026-07-23T20:32:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15944 2024-03-06T10:56:28Z ddc:004 open_access

Algorithmic Problems on Temporal Graphs (Invited Talk) Spirakis, Paul G. Temporal graph stochastic temporal graph vertex cover temporal transitivity Research on Temporal Graphs has expanded in the last few years. Most of the results till now, address problems related to the notion of Temporal Paths (and Temporal Connectivity). In this talk, we focus, instead, on problems whose main topic is not on Temporal Paths. In particular, we will discuss Temporal Vertex Covers, the notion of Temporal Transitivity, and also issues and models of stochastic temporal graphs. We believe that several algorithmic graph problems, not directly related to paths, can be raised in the temporal domain. This may motivate new research towards lifting more topics of algorithmic graph theory to the temporal case. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paul G. Spirakis 2022 Is Part Of LIPIcs, Volume 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAND.2022.2 urn:nbn:de:0030-drops-159446 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.2 eng https://creativecommons.org/licenses/by/4.0/legalcode