On the complexity of temporal arborescence reconfiguration

In this contribution we study the Arborescence Reconfiguration on temporal digraphs (Temporal Arborescence Reconfiguration). The problem, given two temporal arborescences in a temporal digraph, asks for the minimum number of arc flips, i.e., arc exchanges, that result in a sequence of temporal arbor...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1055; s. 115502
Hlavní autori:	Dondi, Riccardo, Lafond, Manuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.11.2025
Predmet:	Approximation complexity Arborescence Graph algorithms Parameterized complexity Temporal graphs Temporal graphs Approximation complexity Arborescence Graph algorithms Parameterized complexity
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!