Welcome to Central Library, SUST
Amazon cover image
Image from Amazon.com
Image from Google Jackets

Graph algorithms / Shimon Even; edited by Guy Even.

By: Contributor(s): Material type: TextTextPublication details: Cambridge, NY : Cambridge University Press, 2012.Edition: 2nd edDescription: xii, 189 p. : ill. ; 24 cmISBN:
  • 9780521517188 (hardback)
  • 9780521736534 (paperback)
Subject(s): DDC classification:
  • 511.5 23 EVG
LOC classification:
  • QA166 .E93 2012
Online resources:
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.
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"--
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Central Library, SUST General Stacks 511.5 EVG (Browse shelf(Opens below)) 1 Available 0063815

Includes bibliographical references and index.

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.

"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"--

There are no comments on this title.

to post a comment.