Refine Results
Sort By
From
To
Page 1
Page 1
Algorithms on Trees and Graphs : With Python Code
Introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode / Correctness proofs are given, together with a worst-case analysis of the algorithms / Full implementation of all the algorithms in Python / An extensive chapter is devoted to the algorithmic techniques used in the book / Solutions to all the problems
Algoritmi : Lo spirito dell’informatica = Algorithms : The spirit of information technology
Algorithms are the heart of computer science and mathematics, since without them the use of computers would not be possible. In this book, which in its English edition has been a longtime bestseller, Harel and Feldmann answer all questions relating to this topic. They talk about the evaluation, correctness and effectiveness of algorithms, but also clarify some doubts about programming techniques and also refer to the very current discussion on quantum computing. The book is useful both as a basic text for an introductory university course in computer science, and as a general introduction to natural sciences, mathematics or engineering.
