[4F1-OS-8a] AIと制約プログラミング(1/2)

[4F1-OS-8a-01] (OS invited talk) Invitation to Combinatorial Reconfiguration

〇Takehiro Ito¹ (1. Tohoku University)

Keywords:Combinatorial Reconfiguration, Graph Algorithm

Combinatorial reconfiguration is a novel algorithmic concept that provides mathematical models and analysis for "transformations over state spaces." Its appearance ranges from theory to applications. For example, the procedure for moving pieces in a sliding block puzzle and the procedure for switching configurations in a power distribution network can be seen from the viewpoint of combinatorial reconfiguration. In recent years, various combinatorial reconfiguration problems on graphs have been actively studied. In this talk, I would like to give a broad introduction of combinatorial reconfiguration and recent research developments.