Applied Discrete Structures

Although this book is intended as a sequel to Foundations of Discrete Mathematics by the same author, it can be read independently of the latter, as the relevant background needed has been reviewed in Chapter 1. The subsequent chapters deal with graph theory (with applications), analysis of algorithms (with a detailed study of a few sorting algorithms and a discussion of tractability), linear programming (with applications, variations, Karmarkars polynomial time algorithm, integer and quadratic programming), applications of algebra (to Polyas theory of counting, Galois theory, coding theory and theory of designs). A chapter on matroids familiarises the reader with this relatively new branch of discrete mathematics.