/Exposé en anglais/Talk in english/
In the token swapping problem, we are given a graph with a labeled token on each vertex along with a final configuration of the tokens, and the goal is to find the minimum number of swaps of adjacent tokens to reach the final configuration. Token swapping is in the area of "Reconfiguration Problems" where the goal is generally to get from an
initial configuration to a final configuration using a step-by-step series of changes. I will talk about both algorithms and hardness for the token swapping problem, mostly focusing on the case where the underlying graph is a tree.
[Nicole Wein] (MIT)
http://people.csail.mit.edu/nwein/
{Remarques/Remarks}
▼
Cet exposé sera enregistré, merci de désactiver votre webcam et micro si vous ne souhaitez pas apparaître sur l'enregistrement. Les échanges informels avant et après l'exposé, ainsi que les questions, ne seront pas enregistrés.
N'hésitez pas à venir un peu avant le début de l'exposé pour faire des tests (et discuter informellement). Nous auront également des discussions informelles post-GT.
À très bientôt,
Marthe & Jonathan
Retrouvez toutes les informations du GT dématérialisé sur https://combalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE
▼
This presentation will be recorded, please deactivate your webcam and microphone if you do not wish to appear on the recording. Informal exchanges before and after the presentation, as well as questions, will not be recorded.
Do not hesitate to come a little before the start of the presentation to test (and chat informally). We will also have informal post-working group discussions.
See you soon,
Marthe & Jonathan
Find all the information of the dematerialized working group on the web page https://combalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE