License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2021.62
URN: urn:nbn:de:0030-drops-138616
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13861/
Becker, Aaron T. ;
Fekete, Sándor P. ;
Konitzny, Matthias ;
Morr, Sebastian ;
Schmidt, Arne
Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition)
Abstract
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.
BibTeX - Entry
@InProceedings{becker_et_al:LIPIcs.SoCG.2021.62,
author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Konitzny, Matthias and Morr, Sebastian and Schmidt, Arne},
title = {{Can You Walk This? Eulerian Tours and IDEA Instructions}},
booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)},
pages = {62:1--62:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-184-9},
ISSN = {1868-8969},
year = {2021},
volume = {189},
editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13861},
URN = {urn:nbn:de:0030-drops-138616},
doi = {10.4230/LIPIcs.SoCG.2021.62},
annote = {Keywords: Eulerian tours, algorithms, education, IDEA instructions}
}
|
Keywords: |
|
Eulerian tours, algorithms, education, IDEA instructions |
|
Collection: |
|
37th International Symposium on Computational Geometry (SoCG 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
02.06.2021 |
