Sliding Token on Bipartite Permutation Graphs

被引：24

作者：

Fox-Epstein, Eli ^{[1
]}

Hoang, Duc A. ^{[2
]}

Otachi, Yota ^{[2
]}

Uehara, Ryuhei ^{[2
]}

机构：

[1] Brown Univ, Providence, RI 02912 USA

[2] JAIST, Nomi, Japan

来源：

ALGORITHMS AND COMPUTATION, ISAAC 2015 | 2015年 / 9472卷

基金：

美国国家科学基金会;

关键词：

D O I：

10.1007/978-3-662-48971-0_21

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Sliding Token is a natural reconfiguration problem in which vertices of independent sets are iteratively replaced by neighbors. We develop techniques that may be useful in answering the conjecture that Sliding Token is polynomial-time decidable on bipartite graphs. Along the way, we give efficient algorithms for Sliding Token on bipartite permutation and bipartite distance-hereditary graphs.

引用

页码：237 / 247

页数：11

共 50 条

[1] BIPARTITE PERMUTATION GRAPHS
SPINRAD, J
BRANDSTADT, A
STEWART, L
DISCRETE APPLIED MATHEMATICS, 1987, 18 (03) : 279 - 292
[2] Bandwidth of Bipartite Permutation Graphs
Uehara, Ryuhei
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 824 - 835
[3] Bipartite Permutation Graphs Are Reconstructible
Kiyomi, Masashi
Saitoh, Toshiki
Uehara, Ryuhei
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 362 - +
[4] BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
Kiyomi, Masashi
Saitoh, Toshiki
Uehara, Ryuhei
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (03)
[5] On opposition graphs, coalition graphs, and bipartite permutation graphs
Le, Van Bang
DISCRETE APPLIED MATHEMATICS, 2014, 168 : 26 - 33
[6] Token Sliding on Chordal Graphs
Bonamy, Marthe
Bousquet, Nicolas
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 127 - 139
[7] Token Sliding on Split Graphs
Belmonte, Remy
Kim, Eun Jung
Lampis, Michael
Mitsou, Valia
Otachi, Yota
Sikora, Florian
36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
[8] Token Sliding on Split Graphs
Rémy Belmonte
Eun Jung Kim
Michael Lampis
Valia Mitsou
Yota Otachi
Florian Sikora
Theory of Computing Systems, 2021, 65 : 662 - 686
[9] Token Sliding on Split Graphs
Belmonte, Remy
Kim, Eun Jung
Lampis, Michael
Mitsou, Valia
Otachi, Yota
Sikora, Florian
THEORY OF COMPUTING SYSTEMS, 2021, 65 (04) : 662 - 686
[10] Vertex deletion into bipartite permutation graphs
Bożyk, Lukasz
Derbisz, Jan
Krawczyk, Tomasz
Novotná, Jana
Okrasa, Karolina
Leibniz International Proceedings in Informatics, LIPIcs, 2020, 180

← 1 2 3 4 5 →