Logo

Combinatorial Algorithms by Albert Nijenhuis, Herbert S. Wilf

Large book cover: Combinatorial Algorithms

Combinatorial Algorithms
by

Publisher: Academic Press Inc
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.

Home page url

Download or read it online for free here:
Download link
(5.5MB, PDF)

Similar books

Book cover: Enumerative Combinatorics: Volume 1Enumerative Combinatorics: Volume 1
by - 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.
(2770 views)
Book cover: Topics in Algebraic CombinatoricsTopics in Algebraic Combinatorics
by - MIT
Contents: Walks in graphs; Cubes and the Radon transform; Random walks; The Sperner property; Group actions on boolean algebras; Young diagrams and q-binomial coefficients; Enumeration under group action; A glimpse of Young tableaux; etc.
(5656 views)
Book cover: Matroid DecompositionMatroid Decomposition
by - 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.
(5774 views)
Book cover: New Perspectives in Algebraic CombinatoricsNew Perspectives in Algebraic Combinatorics
by - Cambridge University Press
The rich combinatorial problems arising from the study of various algebraic structures are the subject of the book. It will present the state of the art to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.
(7697 views)