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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1051; s. 115412
Hlavní autori:	Erlebach, Thomas, Morawietz, Nils, Wolf, Petra
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.10.2025
Predmet:	Almost-clique Dynamic network Fixed-parameter tractability Kernelization Temporal graph Almost-clique Temporal graph Dynamic network Fixed-parameter tractability Kernelization
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!