The book is self-contained and includes the desired mathematical background. The book covers most of the data structures and classical graphs algorithms, string algorithms, matroid algorithms, linear algebra algorithms, flow and circulation algorithms, linear programming solvers, and integer algorithms. It covers several topics which are rarely covered in the existing textbooks. Pseudocode is provided for every algorithm. Proof of correctness and the complexity analysis is given for every algorithm. Examples are also provided to help explain several algorithms. The book is designed for an introductory as well as an advance course in the design and analysis of algorithms. It is intended for undergraduate as well as postgraduate students of computer science and engineering. Some of the topics covered in the book are as follows. i) String homomorphism and isomorphism ii) Detailed proof of graph matching algorithm including augmenting path computation iii) Gallai Edmonds decomposition algorithm iv) Matroid Intersection algorithm Klein. There are excellent textbooks1 available for an undergraduate course on algorithms. However, the same cannot be said for graduate level books on the subject. A graduate level book requires rigorous treatment of two issues for each algorithm: the correctness proof and the time space complexity analysis. The motive behind writing this book was to develop a textbook covering most of the traditional topics but with complete proof of correctness and complexity analysis. The book is not only for a graduate student but also for an advance undergraduate student as well. It is self contained so that an undergraduate student can follow the subject without having to study other books.

Computer Algorithms: Correctness Proofs PDF

The list of books you might like