book · Cambridge University Press eBooks · 2011
Graph Algorithms
Cited by 209Abstract and details only
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.
Cite this paper
Even, S. (2011). Graph Algorithms. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139015165
Even, Shimon. “Graph Algorithms.” Cambridge University Press eBooks, 2011, https://doi.org/10.1017/cbo9781139015165.
Even, Shimon. 2011. “Graph Algorithms.” Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139015165.
Even, S. (2011) ‘Graph Algorithms’, Cambridge University Press eBooks. Available at: https://doi.org/10.1017/cbo9781139015165.
@book{even2011graph,
title = {{Graph Algorithms}},
author = {Even, Shimon},
publisher = {Cambridge University Press eBooks},
year = {2011},
doi = {10.1017/cbo9781139015165}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.