Graph Algorithms by Shimon Even

Shimon Even's textbook Graph Algorithms was
published in 1979 by Computer Science Press.
This work is a real classical gem and was very popular
during the 1980's, but unfortunately production was
stopped in the 1990's for reasons that are unrelated
to the book and its author.

This webpage offers access to extracts of the 1979 textbook,
which were reproduced at Shimon's concent in 1999.

Shimon started revising this book, towards a new edition,
a few years before he died, but he did not complete his revision
and the task was undertaken by his son,
Guy.
This new edition was published by
Cambridge University Press
in November 2011: See the publisher's pages for the
hard
cover and
soft
cover, resp.

Following is the first paragraph of the original preface.

Graph theory has long become recognized as one of the
more useful mathematical subjects for the computer science
student to master. The approach which is natural in computer
science is the algorithmic one; our interest is not so much in
existence proofs or enumeration techniques, as it is in finding
efficient algorithms for solving relevant problems,
or alternatively showing evidence that no such algorithms exist.
Although algorithmic graph theory was started by Euler, if not
earlier, its development in the last ten years has been dramatic
and revolutionary.

You may fetch a
.ps
file containing extracts (selected by Shimon) of chapters 1-6.
Note that these are extracts of the original version,
not of the revision prepared by Shimon in the early 2000's.

Copyright 2005 by Guy Even.
Permission to make copies of part or all of this work for personal or
classroom use is granted without fee provided that copies
are not made or distributed for profit or commercial
advantage and that new copies bear this notice and the full
citation on the first page. Abstracting with credit is permitted.