AI Chat AI Image Generator AI Video Text to Speech

Token Sliding on Split Graphs

07/14/2018

∙

by Rémy Belmonte, et al.

∙

∙

We show that the independent set reconfiguration problem on split graphs under the token sliding rule is PSPACE-complete.

Rémy Belmonte
10 publications
Eun Jung Kim
29 publications
Michael Lampis
28 publications
Valia Mitsou
7 publications
Yota Otachi
32 publications
Florian Sikora
15 publications

page 1

page 2

page 3

page 4

research

∙ 07/09/2017

The complexity of independent set reconfiguration on bipartite graphs

We settle the complexity of the Independent Set Reconfiguration problem ...

0 Daniel Lokshtanov, et al. ∙

research

∙ 01/01/2023

A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets

We continue the study of token sliding reconfiguration graphs of indepen...

0 David Avis, et al. ∙

research

∙ 09/06/2021

Computational Complexity of Jumping Block Puzzles

In combinatorial reconfiguration, the reconfiguration problems on a vert...

0 Masaaki Kanzaki, et al. ∙

research

∙ 12/16/2020

Decentralized Finance, Centralized Ownership? An Iterative Mapping Process to Measure Protocol Token Distribution

In this paper, we analyze various Decentralized Finance (DeFi) protocols...

0 Matthias Nadler, et al. ∙

research

∙ 03/31/2022

On Reconfiguration Graph of Independent Sets under Token Sliding

An independent set of a graph G is a vertex subset I such that there is ...

0 David Avis, et al. ∙

research

∙ 07/26/2023

Higher-dimensional cubical sliding puzzles

We introduce higher-dimensional cubical sliding puzzles that are inspire...

0 Moritz Beyer, et al. ∙

research

∙ 06/30/2021

Parameterized Complexities of Dominating and Independent Set Reconfiguration

We settle the parameterized complexities of several variants of independ...

0 Hans L. Bodlaender, et al. ∙