Graph Algorithms / Shimon Even ; edited by Guy Even.

By:

Even, Shimon [author.]

Contributor(s):

Even, Guy [editor.]

Material type: Text

TextPublisher: Cambridge : Cambridge University Press, 2011Edition: 2nd edDescription: 1 online resource (202 pages) : digital, PDF file(s)Content type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781139015165 (ebook)

Subject(s):

Graph algorithms

Additional physical formats: Print version: : No titleDDC classification:

511/.5 23

LOC classification:

QA166 .E93 2012

Online resources:

Click here to access online

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.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Copy number	Status	Barcode
Books	Library, Institute of Information and Communication Technology General Stacks	511.5 EVG (Browse shelf(Opens below))	1	Available	I000250
Books	Library, Institute of Information and Communication Technology General Stacks	511.5 EVG (Browse shelf(Opens below))	2	Available	I000251
Books	Library, Institute of Information and Communication Technology Audio Visual	511.5 EVG (Browse shelf(Opens below))	3	Available	I000252

Title from publisher's bibliographic system (viewed on 04 Apr 2016).

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.