Files in this item
Faster exploration of some temporal graphs
Item metadata
dc.contributor.author | Adamson, Duncan | |
dc.contributor.author | Gusev, Vladimir V. | |
dc.contributor.author | Malyshev, Dmitriy | |
dc.contributor.author | Zamaraev, Viktor | |
dc.contributor.editor | Aspnes, James | |
dc.contributor.editor | Michail, Othon | |
dc.date.accessioned | 2024-06-06T10:30:01Z | |
dc.date.available | 2024-06-06T10:30:01Z | |
dc.date.issued | 2022-04-29 | |
dc.identifier | 302433225 | |
dc.identifier | 32ecb824-8bcd-4a35-91ec-5f6a0f2d1489 | |
dc.identifier | 85130842261 | |
dc.identifier.citation | Adamson , D , Gusev , V V , Malyshev , D & Zamaraev , V 2022 , Faster exploration of some temporal graphs . in J Aspnes & O Michail (eds) , 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022 . , 5 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 221 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022 , Virtual, Online , 28/03/22 . https://doi.org/10.4230/LIPIcs.SAND.2022.5 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783959772242 | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.other | ORCID: /0000-0003-3343-2435/work/160753719 | |
dc.identifier.uri | https://hdl.handle.net/10023/30001 | |
dc.description | Funding Adamson, Duncan: Funded by the Leverhulme trust. Gusev, Vladimir V.: funded by the Leverhulme trust. Malyshev, Dmitriy: The work of Dmitriy Malyshev was conducted within the framework of the Basic Research Program at the National Research University Higher School of Economics (HSE). | en |
dc.description.abstract | A temporal graph G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a common set of vertices, such that at the ith time step only the edge set Ei is active. The temporal graph exploration problem asks for a shortest temporal walk on some temporal graph visiting every vertex. We show that temporal graphs with n vertices can be explored in O(kn1.5 log n) days if the underlying graph has treewidth k and in O(n1.75 log n) days if the underlying graph is planar. Furthermore, we show that any temporal graph whose underlying graph is a cycle with k chords can be explored in at most 6kn days. Finally, we demonstrate that there are temporal realisations of sub cubic planar graphs that cannot be explored faster than in Ω(n log n) days. All these improve best known results in the literature. | |
dc.format.extent | 627434 | |
dc.language.iso | eng | |
dc.publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing | |
dc.relation.ispartof | 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022 | en |
dc.relation.ispartofseries | Leibniz International Proceedings in Informatics, LIPIcs | en |
dc.subject | Graph Exploration | en |
dc.subject | Temporal Graphs | en |
dc.subject | Software | en |
dc.subject | T-NDAS | en |
dc.subject | NIS | en |
dc.title | Faster exploration of some temporal graphs | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.4230/LIPIcs.SAND.2022.5 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.