Abstract
We study a reconfiguration problem for Steiner trees in an unweighted graph, which determines whether there exists a sequence of Steiner trees that transforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs, while solvable in linear time for interval graphs and for cographs.
| Original language | English |
|---|---|
| Pages (from-to) | 1532-1540 |
| Number of pages | 9 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E100A |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 2017 Jul |
Keywords
- Cograph
- Combinatorial reconfiguration
- Interval graph
- PSPACE-complete
- Split graph
- Steiner tree
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics