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