CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract)


  • Takehide Soh Information Infrastructure and Digital Transformation Initiatives Headquaters, Kobe University, Japan
  • Tomoya Tanjo Bioinformation and DDBJ Center, National Institute of Genetics, Japan
  • Yoshio Okamoto Graduate School of Informatics and Engineering, The University of Electro-Communications, Japan
  • Takehiro Ito Graduate School of Information Sciences, Tohoku University, Japan



In this extended abstract, we describe CoRe Challenge 2022/2023, an international competition series aiming to construct the technical foundation of practical research for Combinatorial Reconfiguration. This competition series targets one of the most well-studied reconfiguration problems, called the independent set reconfiguration problem under the token jumping model, which asks a step-by-step transformation between two given independent sets in a graph. Theoretically, the problem is PSPACE-complete, which implies that there exist instances such that even a shortest transformation requires super-polynomial steps with respect to the input size under the assumption of $NP \neq PSPACE$. The competition series consists of four tracks: three tracks take two independent sets of a graph as input, and ask the existence of a transformation, a shortest transformation, a longest transformation between them; and the last track takes only a number of vertices as input, and asks for an instance of the specified number of vertices that needs a longer shortest transformation steps. We describe the background of the competition series and highlight the results of the solver and graph tracks.