BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Graph Algorithms

Graph Algorithms

Graph Algorithms
Stock photo: cover may vary

Graph Algorithms Hardback - 2011 - 2nd Edition

by Even, Shimon

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press, 2011-09-19. 2. hardcover. New. 6.25x0.50x9.25. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$190.61
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

  • Title Graph Algorithms
  • Author Even, Shimon
  • Binding Hardback
  • Edition number 2nd
  • Edition 2
  • Condition New
  • Pages 202
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2011-09-19
  • Features Bibliography, Index
  • Bookseller's Inventory # DADAX0521517184
  • ISBN 9780521517188 / 0521517184
  • Weight 0.9 lbs (0.41 kg)
  • Dimensions 9.1 x 6.2 x 0.6 in (23.11 x 15.75 x 1.52 cm)
  • Size 6.25x0.50x9.25
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - Languages / Programming
  • Library of Congress subjects Graph algorithms, COMPUTERS / Programming / Algorithms
  • Library of Congress Catalogue Number 2011037984
  • Dewey Decimal Code 511.5
  • Quantity available 10

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Graph Algorithms

From the publisher

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