In Theorem 1.3.1 we gave a characterization for Eulerian graphs: a graph G is Eulerian if and only if each vertex of G has even degree. This condition is easy to verify for any given graph. But how can we really find an Euler tour in an Eulerian graph? The proof of Theorem 1.3.1 not only guarantees that such a tour exists, but actually contains a hint how to construct such a tour. We want to convert this hint into a general method for constructing an Euler tour in any given Eulerian graph; in short, into an algorithm. In this book we generally look at problems from the algorithmic point of view: we want more than just theorems about existence or structure. As Lüneburg once said [Lue82], it is important in the end that we can compute the objects we are working with. However, we will not go as far as giving concrete programs, but describe our algorithms in a less formal way. Our main goal is to give an overview of the basic methods used in a very large area of mathematics; we can achieve this (without exceeding the limits of this book) only by omitting the details of programming techniques. Readers interested in concrete programs are referred to [SyDK83] and [NiWi78], where programs in PASCAL and FORTRAN, respectively, can be found.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Algorithms and Complexity. In: Graphs, Networks and Algorithms. Algorithms and Computation in Mathematics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72780-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-72780-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72779-8
Online ISBN: 978-3-540-72780-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)