Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.15593 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917478613909504 |
|---|---|
| author | Sievers, Paul Skretas, George Tennigkeit, Georg |
| author_facet | Sievers, Paul Skretas, George Tennigkeit, Georg |
| contents | Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain times, we are sometimes only allowed to modify when the edges are going to be active. In practice, we might not even be able to perform all of the necessary modifications at once; changes must be applied step-by-step while the network is still in operation, meaning that the network must continue to satisfy some properties. To initiate a study in this area, we introduce the class of temporal graph reconfiguration problems. As a starting point, we consider the Layered Connectivity Reconfiguration (LCR) problem: Given two always-connected temporal graphs G1 and G2, determine if it is possible to transform G1 into G2 by changing the time at which a single temporal edge is active in each step, such that every intermediate temporal graph is always-connected. We provide a dynamic programming algorithm for the LCR problem. We also show that finding the shortest reconfiguration sequence between two temporal graphs is APX-hard. Additionally, we show that the LCR problem is equivalent to the Spanning Tree Sequence Reconfiguration (STSR) problem introduced by Hanaka et al. Therefore, our results also answer the two open questions presented by the authors: (i) find a simpler algorithm for the STSR problem, (ii) show that the STSR problem is inapproximable up to some factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15593 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Temporal Graph Reconfiguration for Always-Connected Graphs Sievers, Paul Skretas, George Tennigkeit, Georg Data Structures and Algorithms Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain times, we are sometimes only allowed to modify when the edges are going to be active. In practice, we might not even be able to perform all of the necessary modifications at once; changes must be applied step-by-step while the network is still in operation, meaning that the network must continue to satisfy some properties. To initiate a study in this area, we introduce the class of temporal graph reconfiguration problems. As a starting point, we consider the Layered Connectivity Reconfiguration (LCR) problem: Given two always-connected temporal graphs G1 and G2, determine if it is possible to transform G1 into G2 by changing the time at which a single temporal edge is active in each step, such that every intermediate temporal graph is always-connected. We provide a dynamic programming algorithm for the LCR problem. We also show that finding the shortest reconfiguration sequence between two temporal graphs is APX-hard. Additionally, we show that the LCR problem is equivalent to the Spanning Tree Sequence Reconfiguration (STSR) problem introduced by Hanaka et al. Therefore, our results also answer the two open questions presented by the authors: (i) find a simpler algorithm for the STSR problem, (ii) show that the STSR problem is inapproximable up to some factor. |
| title | Temporal Graph Reconfiguration for Always-Connected Graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2510.15593 |