Graph algorithms

Graph algorithms

by Even, Shimon

Type Book
Rate 0.0 /5

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-f…

Read More ↓

Title Statements

  • Full title :Graph algorithms / Shimon Even ; edited by Guy Even.

Summary

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.

Read More ↓

Edition Statements

  • Publication Date:2012
  • Edition:Second edition

Publication Statements

Notes

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

The Physical Object

  • Description:1 online resource (xii, 189 Seiten)

Edition Identifiers

  • ISBN:9781139015165, 1139015168, 9780521517188, 0521517184, 9780521736534, 0521736536
  • DOI:10.1017/CBO9781139015165
  • oclc:ocn967687274
  • LC Classification:QA166
  • Dewey Decimal:511/.5

Table of Contents

Machine generated contents note: 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.

Read More ↓

Subjects

Writers

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Graph Algorithms -- (.pdf)

    PDF · 1.5 MB · updated
  • Graph Algorithms -- (.pdf)

    PDF · 1.3 MB · updated
  • Graph algorithms -- (.pdf)

    PDF · 1.1 MB · updated
  • Graph algorithms -- (.pdf)

    PDF · 3.1 MB · updated
  • Graph Algorithms -- (.djvu)

    DJVU · 4.8 MB · updated