Shimon Even

Graph Algorithms

Herausgeber: Even, Guy

• Broschiertes Buch

Produktbeschreibung

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. Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory textbook. 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, explaining algorithms in formal but simple language with a direct and intuitive presentation.

Produktdetails

• Verlag: Cambridge University Press
• 2. Aufl.
• Seitenzahl: 202
• Erscheinungstermin: 10. Februar 2015
• Englisch
• Abmessung: 229mm x 152mm x 12mm
• Gewicht: 290g
• ISBN-13: 9780521736534
• ISBN-10: 0521736536
• Artikelnr.: 34008870

Autorenporträt

Shimon Even (1935-2004) was a pioneering researcher on graph algorithms and cryptography. He was a highly influential educator who played a major role in establishing computer science education in Israel at the Weizmann Institute and the Technion. He served as a source of professional inspiration and as a role model for generations of students and researchers. He is the author of Algorithmic Combinatorics (1973) and Graph Algorithms (1979).

Inhaltsangabe

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.

---

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.

Rezensionen

'[This book] provides an intensive study of the main topics of the field, with [a] list of problems following each topic and explains algorithms in a formal but simple language with a direct and intuitive presentation. Its usage is not limited to being a textbook for an upper-level undergraduate or a graduate course in mathematics. Thanks to the rich set of results covered it can also be used as a reference book for postgraduate students and researchers in the area of Graph algorithms ... Besides being extremely useful to those who are interested in theory of graphs and design of graph algorithms, instructors can also benefit from the easy way it presents various ideas and approaches to problem solutions.' Vladimir Lacko, Zentralblatt MATH