Graph Algorithms
2nd Edition
Published on 19. September 2011
Book
Paperback/Softback
202 pages
978-0-521-73653-4 (ISBN)
Description
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
Reviews / Votes
'[This book] provides an intensive study of the main topics of the field, with [a] list of problems following each topic and explains algorithms in a formal but simple language with a direct and intuitive presentation. Its usage is not limited to being a textbook for an upper-level undergraduate or a graduate course in mathematics. Thanks to the rich set of results covered it can also be used as a reference book for postgraduate students and researchers in the area of Graph algorithms ... Besides being extremely useful to those who are interested in theory of graphs and design of graph algorithms, instructors can also benefit from the easy way it presents various ideas and approaches to problem solutions.' Vladimir Lacko, Zentralblatt MATH 'The book is an excellent introduction to (algorithmic) graph theory, and seems to be a good choice for a class on the topic, or for self-study. Each chapter comes with its own selected bibliography, and ends with a collection of problems to help the reader check his or her understanding of the material presented in that chapter. Proofs are always provided and are also the topic of a few selected exercises.' Anthony Labarre, SIGACT NewsMore details
Edition
2nd Revised edition
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Edition type
Revised edition
Product notice
Paperback (trade)
Illustrations
10 Tables, unspecified; 64 Line drawings, unspecified
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 12 mm
Weight
301 gr
ISBN-13
978-0-521-73653-4 (9780521736534)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Shimon Even | Guy Even
Graph Algorithms
E-Book
02/2012
2nd Edition
Cambridge University Press
€32.49
Available for download
Shimon Even | Guy Even
Graph Algorithms
Book
09/2011
2nd Edition
Cambridge University Press
€113.80
Shipment within 15-20 days
Persons
Shimon Even (1935-2004) was a pioneering researcher on graph algorithms and cryptography. He was a highly influential educator who played a major role in establishing computer science education in Israel at the Weizmann Institute and the Technion. He served as a source of professional inspiration and as a role model for generations of students and researchers. He is the author of Algorithmic Combinatorics (1973) and Graph Algorithms (1979).
Content
1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity.