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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1055; p. 115502
Main Authors:	Dondi, Riccardo, Lafond, Manuel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.11.2025
Subjects:	Approximation complexity Arborescence Graph algorithms Parameterized complexity Temporal graphs Temporal graphs Approximation complexity Arborescence Graph algorithms Parameterized complexity
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!