Defines LCR problem on always-connected temporal graphs, gives DP algorithm, proves APX-hardness of shortest reconfiguration, and establishes equivalence to STSR.
6 Argyrios Deligkas, Eduard Eiben, and George Skretas
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Temporal Graph Reconfiguration for Always-Connected Graphs
Defines LCR problem on always-connected temporal graphs, gives DP algorithm, proves APX-hardness of shortest reconfiguration, and establishes equivalence to STSR.