Reconfiguration of steiner trees in an unweighted graph

Haruka Mizuta, Takehiro Ito, Xiao Zhou

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 languageEnglish
Pages (from-to)1532-1540
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE100A
Issue number7
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Reconfiguration of steiner trees in an unweighted graph'. Together they form a unique fingerprint.

Cite this