2026-08-07T12:10:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13861 2024-03-06T10:52:54Z ddc:004 open_access

Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition) Becker, Aaron T. Fekete, Sándor P. Konitzny, Matthias Morr, Sebastian Schmidt, Arne Eulerian tours algorithms education IDEA instructions We illustrate and animate the classic problem of deciding whether a given graph has an Eulerian path. Starting with a collection of instances of increasing difficulty, we present a set of pictorial instructions, and show how they can be used to solve all instances. These IDEA instructions ("A series of nonverbal algorithm assembly instructions") have proven to be both entertaining for experts and enlightening for novices. We (w)rap up with a song and dance to Euler’s original instance. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Aaron T. Becker and Sándor P. Fekete and Matthias Konitzny and Sebastian Morr and Arne Schmidt 2021 Is Part Of LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2021.62 urn:nbn:de:0030-drops-138616 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.62 eng https://creativecommons.org/licenses/by/4.0/legalcode