Graph Algorithms

Even Shimon

ISBN 10: 0521736536 / ISBN 13: 9780521736534

Edité par Cambridge University Press, 2011

A propos de cet article

pp. 202 64 Illus.

N° de réf. du vendeur 3556863

Détails bibliographiques

• Titre: Graph Algorithms
• Éditeur: Cambridge University Press
• Date de parution: 2011
• Langue: anglais
• ISBN à 10 chiffres: 0521736536
• ISBN à 13 chiffres: 9780521736534
• Reliure: Couverture souple
• Édition: 2ème Édition
• État de l'article: New

A propos de ce titre

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.

À propos de l?auteur

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