Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2508.05351 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918117140070400 |
|---|---|
| author | Shen, Fangjian Zheng, Yicheng Wen, Wushao Zhuo, Hankz Hankui |
| author_facet | Shen, Fangjian Zheng, Yicheng Wen, Wushao Zhuo, Hankz Hankui |
| contents | In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of edges whose removal transforms the graph into a spanning tree. For the undirected version, our algorithm achieves a time complexity of $O(n^2 \log n \cdot 2^{k \log k})$. For the directed version, we propose a more efficient algorithm with a time complexity of $O(n^2 \cdot 2^{4k-3})$, where $n$ is the number of vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_05351 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size Shen, Fangjian Zheng, Yicheng Wen, Wushao Zhuo, Hankz Hankui Data Structures and Algorithms In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of edges whose removal transforms the graph into a spanning tree. For the undirected version, our algorithm achieves a time complexity of $O(n^2 \log n \cdot 2^{k \log k})$. For the directed version, we propose a more efficient algorithm with a time complexity of $O(n^2 \cdot 2^{4k-3})$, where $n$ is the number of vertices. |
| title | Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2508.05351 |