Graph Algorithms

Shimon Even

ISBN 10: 0521736536 / ISBN 13: 9780521736534

Published by Cambridge University Press, 2011

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9780521736534

Bibliographic Details

• Title: Graph Algorithms
• Publisher: Cambridge University Press
• Publication Date: 2011
• Language: English
• ISBN 10: 0521736536
• ISBN 13: 9780521736534
• Binding: Taschenbuch
• Edition: 2nd Edition
• Condition: Neu
• Dimensions: 229W x 152H x 12D millimeters 229 millimeters width by 152 millimeters height by 12 millimeters depth
• Weight: 301 grams

About this title

Synopsis

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.

About the Author

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).