To view prices and purchase online, please login or create an account now.



Graph Algorithms

Hardback

Main Details

Title Graph Algorithms
Authors and Contributors      By (author) Shimon Even
Edited by Guy Even
Physical Properties
Format:Hardback
Pages:202
Dimensions(mm): Height 235,Width 158
Category/GenreAlgorithms and data structures
ISBN/Barcode 9780521517188
ClassificationsDewey:005.1 511.5
Audience
Professional & Vocational
Edition 2nd Revised edition
Illustrations 10 Tables, unspecified; 64 Line drawings, unspecified

Publishing Details

Publisher Cambridge University Press
Imprint Cambridge University Press
Publication Date 19 September 2011
Publication Country United Kingdom

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.

Author Biography

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).

Reviews

'[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 News