Inbunden, Engelska, 2011

Graph Algorithms

1492 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum: 2011-09-19
Mått: 158 x 235 x 16 mm
Vikt: 410 g
Format: Inbunden
Språk: Engelska
Antal sidor: 202
Upplaga: 2
Förlag: Cambridge University Press
ISBN: 9780521517188

Utforska kategorier

Programmeringsböcker

Mer om författaren

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

Recensioner i media

'[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

Betyg & recensioner

0 recensioner

Inga recensioner tillgängliga.