Parameterised temporal exploration problems

We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal exploration) or, in some variants, a certain subset of the vertices. In the strict variant, edges must be traversed in strictly increasing tim...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 135; s. 73 - 88
Hlavní autoři: Erlebach, Thomas, Spooner, Jakob T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.08.2023
Témata:
Fixed-parameter tractability
Parameterised complexity
Temporal graphs
Temporal graphs
Fixed-parameter tractability
Parameterised complexity
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal exploration) or, in some variants, a certain subset of the vertices. In the strict variant, edges must be traversed in strictly increasing timesteps; in the non-strict variant, any number of edges can be traversed in each timestep. For both variants, we give FPT algorithms for finding a temporal walk that visits a given set X of vertices, parameterised by |X|, and for finding a temporal walk that visits at least k distinct vertices, parameterised by k. We also show W[2]-hardness for a set version of temporal exploration. For the non-strict variant, we give an FPT algorithm for temporal exploration parameterised by the lifetime, and show that temporal exploration can be solved in polynomial time if the graph in each timestep has at most two connected components.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2023.01.003