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
An Introduction to Combinatorics and Graph Theoryby David Guichard - Whitman College
The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
(1329 views)
Matroid Decompositionby 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.
(4726 views)
Algebraic and Geometric Methods in Enumerative Combinatoricsby Federico Ardila - arXiv
The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
(2717 views)
Combinatory Analysisby Percy A. MacMahon - Cambridge University Press
The object of this work is to present an account of theorems in combinatory analysis which are of a perfectly general character, and to shew the connexion between them by as far as possible bringing them together as parts of a general doctrine ...
(2001 views)