|
" Graph algorithms / "
Shimon Even ; edited by Guy Even
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
658648
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Even, Shimon
|
| Title & Author
|
:
|
Graph algorithms /\ Shimon Even ; edited by Guy Even
|
| Edition Statement
|
:
|
2nd ed
|
| Publication Statement
|
:
|
Cambridge ;New York :: Cambridge University Press,, 2012
|
| Page. NO
|
:
|
xii, 189 p. :: ill. ;; 24 cm
|
| ISBN
|
:
|
9780521517188 (hardback)
|
|
|
:
|
: 0521517184 (hardback)
|
|
|
:
|
: 9780521736534 (paperback)
|
|
|
:
|
: 0521736536 (paperback)
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index
|
| 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
|
| Abstract
|
:
|
"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"--Provided by 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"--Provided by publisher
|
| Subject
|
:
|
Graph algorithms
|
| Dewey Classification
|
:
|
511/.5
|
| LC Classification
|
:
|
QA166.E93 2012
|
| |