**Combinatorial Algorithms**

by Albert Nijenhuis, Herbert S. Wilf

**Publisher**: Academic Press Inc 1978**ISBN/ASIN**: 0125192509**ISBN-13**: 9780125192507**Number of pages**: 316

**Description**:

The book is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.

Download or read it online for free here:

**Download link**

(5.5MB, PDF)

## Similar books

**Analytic Combinatorics**

by

**Philippe Flajolet, Robert Sedgewick**-

**Cambridge University Press**

Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.

(

**12725**views)

**Matroid Decomposition**

by

**Klaus Truemper**-

**Leibniz**

Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. The exposition is clear and simple.

(

**6148**views)

**Enumerative Combinatorics: Volume 1**

by

**Richard P. Stanley**-

**MIT**

The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.

(

**3207**views)

**Applied Combinatorics**

by

**Mitchel T. Keller, William T. Trotter**-

**Georgia Institute of Technology**

The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics.

(

**5322**views)