File(s) under embargo

Reason: 12 month publisher embargo

3

month(s)

10

day(s)

until file(s) become available

On temporal graph exploration

conference contribution
posted on 25.02.2021, 16:54 by Thomas Erlebach, Michael Hoffmann, Frank Kammer
The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. In the first and second part of the paper, we consider only undirected temporal graphs that are connected at each time step. For such temporal graphs with n nodes, we show that it is NP-hard to approximate TEXP with ratio for every and present several solutions for special graph classes. In the third part of the paper, we consider settings where the graphs in future time steps are not known. We show that m-edge temporal graphs with regularly present edges and with probabilistically present edges can be explored online in time steps and time steps with high probability, respectively.

History

Citation

Journal of Computer and System Sciences Volume 119, August 2021, Pages 1-18

Author affiliation

School of Informatics

Version

AM (Accepted Manuscript)

Published in

Journal of Computer and System Sciences

Volume

9134

Pagination

444 - 455

Publisher

Elsevier BV

issn

0022-0000

isbn

978-3-662-47671-0

Acceptance date

26/01/2021

Copyright date

2021

Available date

05/02/2022

Editors

Halldórsson MM; Iwama K; Kobayashi N; Speckmann B

Language

en