Abstract
The famous mathematician Leonhard Euler posed the Königsberg Bridges Problem: Can you cross all seven bridges exactly once on a walk and then return to the starting point? This playful question has important applications in fields such as route planning. In this chapter the authors show how to determine whether an Eulerian circuit exists in a figure, and in so doing they show how to solve problems such as the well-known House of Santa Claus riddle. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Behrisch, M., Coja-Oghlan, A., & Liske, P. (2011). Eulerian circuits. In Algorithms Unplugged (pp. 277–283). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
