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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 135; pp. 73 - 88
Main Authors:	Erlebach, Thomas, Spooner, Jakob T.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.08.2023
Subjects:	Fixed-parameter tractability Parameterised complexity Temporal graphs Temporal graphs Fixed-parameter tractability Parameterised complexity
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!