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 Papeback - - 2nd Edition

by Shimon Even

Add to wish list
  • New
New

Description

Cambridge University Press CUP , pp. 202 2nd Edition . Papeback. New.
Ask the seller a question Add to wish list
A$118.35
A$5.71 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Graph Algorithms
  • Author Shimon Even
  • Binding Papeback
  • Edition number 2nd
  • Edition 2
  • Condition New
  • Pages 202
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press CUP
  • Publication date pp. 202 2nd Edition
  • Features Bibliography, Index
  • Bookseller's Inventory # 64312595
  • ISBN 9780521736534 / 0521736536
  • Weight 0.65 lbs (0.29 kg)
  • Dimensions 8.9 x 6 x 0.5 in (22.61 x 15.24 x 1.27 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 4

About Cold Books New York, United States

Biblio member since 2012

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.

Browse books from Cold Books

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-