Graph Algorithms, 2nd Edition,Used

Graph Algorithms, 2nd Edition,Used

In Stock
SKU: SONG0521736536
Brand: Cambridge University Press
Condition: Used
Regular price$79.05
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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, depthfirstsearch, and breadthfirst 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: What topics are covered in 'Graph Algorithms, 2nd Edition'? A: 'Graph Algorithms, 2nd Edition' covers a range of topics including basic graph theory, shortest paths, trees, depth-first search, breadth-first search, network flows, and planar graphs.
  • Q: Who is the author of this book? A: The author of 'Graph Algorithms, 2nd Edition' is Shimon Even.
  • Q: Is this book suitable for beginners in algorithms? A: Yes, this book is designed as an introductory text on algorithms, making it suitable for beginners as well as those looking to refresh their knowledge.
  • Q: What is the publication date of 'Graph Algorithms, 2nd Edition'? A: 'Graph Algorithms, 2nd Edition' was published on November 17, 2011.
  • Q: What is the condition of the book? A: The book is listed as 'New'.
  • Q: How many pages does 'Graph Algorithms, 2nd Edition' have? A: 'Graph Algorithms, 2nd Edition' contains 202 pages.
  • Q: What type of binding does this book have? A: The book is available in paperback binding.
  • Q: Does this edition include notes from other authors? A: Yes, the second edition includes notes by Andrew V. Goldberg and a foreword by Richard M. Karp.
  • Q: What type of audience would benefit from this book? A: This book is beneficial for students, educators, and professionals who are engaged in computer science, particularly in the field of algorithms.
  • Q: Are there any features highlighted in the book description? A: The book is described as a 'Used Book in Good Condition,' indicating that it has been well-maintained.

Recently Viewed