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.2.1 Tree Definitions Let G(V, E) be an undirected, finite, or infinite graph. We say that G is circuitfree if there are no simple circuits in G. G is called a tree if it is connected and circuit-free. Theorem 2.1 The following four conditions are equivalent:anbsp;...

Title | : | Graph Algorithms |

Author | : | Shimon Even |

Publisher | : | Cambridge University Press - 2011-09-19 |

Continue