Graph algorithms

by Even, Shimon

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Graph algorithms / Shimon Even ; edited by Guy Even.

Summary

This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language.

"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"--

Edition Statements

Publication Date:2012.
Edition:2nd ed

Publication Statements

Publisher(s):Cambridge University Press
Place of Publication:Cambridge
Language:eng
Publication Date:2012.

The Physical Object

Description:1 online resource (xii, 189 pages) : : illustrations

Edition Identifiers

ISBN:9781139220194, 1139220195, 1139217097, 9781139217095, 9781139015165, 1139015168
oclc:ocn775869744
LC Classification:QA166
Dewey Decimal:005.1

Cover; Graph Algorithms, 2nd Edition; Title; Copyright; Contents; Foreword; Preface to the Second Edition; Preface to the First Edition; 1 Paths in Graphs; 1.1 Introduction to Graph Theory; 1.2 Computer Representation of Graphs; 1.3 Euler Graphs; 1.4 De Bruijn Sequences; 1.5 Shortest-Path Algorithms; 1.5.1 Breadth-First Search; 1.5.2 Dijkstra's Algorithm; 1.5.3 The Ford Algorithm; 1.5.4 The Floyd Algorithm; 1.6 Problems; Bibliography; 2 Trees; 2.1 Tree Definitions; 2.2 Minimum Spanning Tree; 2.3 Cayley's Theorem; 2.4 Directed Tree Definitions; 2.5 The Infinity Lemma; 2.6 Problems.