Graph algorithms / Shimon Even ; edited by Guy Even.

Even, Shimon
Call Number
511/.5
Author
Even, Shimon, author.
Title
Graph algorithms / Shimon Even ; edited by Guy Even.
Edition
Second edition.
Physical Description
1 online resource (xii, 189 pages) : digital, PDF file(s).
Notes
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
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.
Added Author
Guy Even, editor.
Subject
Graph algorithms.
Multimedia
Total Ratings: 0
No records found to display.
 
 
 
02152nam a22003858i 4500
001
 
 
vtls001585053
003
 
 
VRT
005
 
 
20200921122300.0
006
 
 
m|||||o||d||||||||
007
 
 
cr||||||||||||
008
 
 
200921s2012||||enk     o     ||1 0|eng|d
020
$a 9781139015165 (ebook)
020
$z 9780521517188 (hardback)
020
$z 9780521736534 (paperback)
035
$a (UkCbUP)CR9781139015165
039
9
$y 202009211223 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA166 $b .E93 2012
082
0
0
$a 511/.5 $2 23
100
1
$a Even, Shimon, $e author.
245
1
0
$a Graph algorithms / $c Shimon Even ; edited by Guy Even.
250
$a Second edition.
264
1
$a Cambridge : $b Cambridge University Press, $c 2012.
300
$a 1 online resource (xii, 189 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505
8
$a 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.
520
$a 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.
650
0
$a Graph algorithms.
700
0
$a Guy Even, $e editor.
776
0
8
$i Print version: $z 9780521517188
856
4
0
$u https://doi.org/10.1017/CBO9781139015165
999
$a VIRTUA               
No Reviews to Display
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.
Notes
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
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.
Subject
Graph algorithms.
Multimedia