Reconfiguration of steiner trees in an unweighted graph

Haruka Mizuta; Takehiro Ito; Xiao Zhou

doi:10.1587/transfun.E100.A.1532

Reconfiguration of steiner trees in an unweighted graph

Haruka Mizuta, Takehiro Ito, Xiao Zhou

INF - System Information Sciences

Research output: Contribution to journal › Article

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 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	https://doi.org/10.1587/transfun.E100.A.1532
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

Access to Document

10.1587/transfun.E100.A.1532

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

Cite this

@article{1921ad5f69224a0f85d6aa69828da680,

title = "Reconfiguration of steiner trees in an unweighted graph",

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.",

keywords = "Cograph, Combinatorial reconfiguration, Interval graph, PSPACE-complete, Split graph, Steiner tree",

author = "Haruka Mizuta and Takehiro Ito and Xiao Zhou",

year = "2017",

month = jul,

doi = "10.1587/transfun.E100.A.1532",

language = "English",

volume = "E100A",

pages = "1532--1540",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "7",

}

TY - JOUR

T1 - Reconfiguration of steiner trees in an unweighted graph

AU - Mizuta, Haruka

AU - Ito, Takehiro

AU - Zhou, Xiao

PY - 2017/7

Y1 - 2017/7

N2 - 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.

AB - 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.

KW - Cograph

KW - Combinatorial reconfiguration

KW - Interval graph

KW - PSPACE-complete

KW - Split graph

KW - Steiner tree

UR - http://www.scopus.com/inward/record.url?scp=85021807093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021807093&partnerID=8YFLogxK

U2 - 10.1587/transfun.E100.A.1532

DO - 10.1587/transfun.E100.A.1532

M3 - Article

AN - SCOPUS:85021807093

VL - E100A

SP - 1532

EP - 1540

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 7

ER -