Parameterized algorithms for multi-label periodic temporal graph realization

In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period Δ and an n×n matrix D of desired fastest travel times, and the task is to decide if there is a simple periodic temporal graph with period Δ such that the fastest travel time between a...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1051; p. 115412
Main Authors:	Erlebach, Thomas, Morawietz, Nils, Wolf, Petra
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.10.2025
Subjects:	Almost-clique Dynamic network Fixed-parameter tractability Kernelization Temporal graph Almost-clique Temporal graph Dynamic network Fixed-parameter tractability Kernelization
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!