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

2011. 2. Hardcover. New.
Ask the seller a question Add to wish list
A$364.65
A$21.26 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from BookVistas (Delhi, India)

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
  • Features Bibliography, Index
  • Bookseller's Inventory # Atlantic-9780521517188
  • 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)
  • 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 500

About BookVistas Delhi, India

Biblio member since 2011

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from BookVistas

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-