Workshop "Graph Theory for Combinatorial Reconfiguration"
Date and time: | 2021.11.29 Mon.
|
---|---|
Venue: | Online (Free of charge) |
Summary: | As a part of the research project "Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial Reconfiguration" (head investigator: Takehiro Ito), we are going to organize Workshop "Graph Theory for Combinatorial Reconfiguration" via Zoom on November 29 (based on European Timezone).
A basic idea is to share fundamental concepts in graph theory that can be potentially applied for combinatorial reconfiguration problems and identify future research directions. In graph theory, combinatorial reconfiguration has been widely used; Reduction of graphs such as deletion and contraction of edges in graph minors; Kempe chains in graph coloring, which give important insights to a proof of the Four Color Theorem; and Diagonal flips of triangulations. This workshop aims at the broad audience of discrete mathematics and theoretical computer science, who wish to learn and work on this active research area.
The program will be exclusively composed of invited talks. Each talk is planned to span one hour, including discussion.
List of Confirmed Invited Speakers
Program, Talk Abstracts, and Registration
Organizers
|
Update:2021.11.05