| 研究実績の概要 |
This project aims to investigate the (in)tractability of different reconfiguration problems under Token Sliding (TS), which may hopefully derive
useful knowledge of P, NP, and PSPACE. We form a reconfiguration graph where nodes are vertex-subsets of the input graph and two nodes are adjacent if one can be obtained from the other by TS. We aim to study the structure of such graphs for different input graphs and subsets. Some primary results have been found. Unfortunately, they have not been significant enough for publication.
|
