Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Graph Algorithms

2nd Edition

$40.99 (P)

  • Date Published: September 2011
  • availability: Available
  • format: Paperback
  • isbn: 9780521736534

$ 40.99 (P)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Classic text with revisions by the author offers an attractive choice of topics with simple yet precise explanations
    • Foreword by Richard M. Karp
    Read more

    Reviews & endorsements

    "If you use graph algorithms, you should get a copy."
    Paul Cull, Computing Reviews

    "Like the original, the second edition has an unmistakable style and presentation that makes the material both clear and deep. By restricting the treatment to graph algorithms--and not to algorithms in general--the book, in around 200 pages, expounds deeply on the subject in ways normally reserved for literature reviews. On the other hand, the presentation is so clear that, as a side benefit, readers are instructed by example how to think about and present complex material. Thus, even for an audience only tangentially interested in graph algorithms, this remains required reading."
    William Fahle, Computing Reviews

    "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, Laboratoire d’informatique Gaspard-Monge for SIGACT News

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Edition: 2nd Edition
    • Date Published: September 2011
    • format: Paperback
    • isbn: 9780521736534
    • length: 202 pages
    • dimensions: 229 x 152 x 11 mm
    • weight: 0.28kg
    • contains: 64 b/w illus. 10 tables
    • availability: Available
  • Table of Contents

    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.

  • Instructors have used or reviewed this title for the following courses

    • Advanced knowledge based systems
    • Algorithms and Complexity
    • Computer Science Senior Research
    • Data Structures and Algorithm Analysis
    • Graph and combinatorial algorithms
    • Intro to game programming
  • Author

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

    Editor

    Guy Even, Tel-Aviv University

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×