Advertisement

Eulerian Circuits

  • Michael Behrisch
  • Amin Coja-Oghlan
  • Peter Liske

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.

Keywords

Travelling Salesman Problem Garbage Collection Garbage Collector Eulerian Circuit Node Junction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Behrisch
    • 1
  • Amin Coja-Oghlan
    • 2
  • Peter Liske
    • 1
  1. 1.Humboldt-Universität zu BerlinBerlinGermany
  2. 2.University of WarwickCoventryUK

Personalised recommendations