Combinatorial Algorithms

For Computers and Calculators

Albert Nijenhuis, Herbert S. Wilf, Werner Rheinboldt

• Publisher: Academic Press
• Year: 2014
• Print ISBN: 9780125192606
• eBook ISBN: 9781483273457
• Edition: 2
• Topic: Mathematics
• Subtopic: Mathematics General
• Index: Mathematics

Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2n subsets of the set {1, 2,..., n}. The discussion then turns to the random subset and k-subset of an n-set; next composition of n into k parts; and random composition of n into k parts. Subsequent chapters focus on sequencing, ranking, and selection algorithms in general combinatorial families; renumbering rows and columns of an array; the cycle structure of a permutation; and the permanent function. Sorting and network flows are also examined, along with the backtrack method and triangular numbering in partially ordered sets. This book will be of value to both students and specialists in the fields of applied mathematics and computer science.

Table of contents

• Front Cover
• Combinatorial Algorithms: For Computers and Calculators
• Copyright Page
• Dedication
• Table of Contents
• Preface to Second Edition
• Preface to First Edition
• Introduction
• PART I: COMBINATORIAL FAMILIES
• PART II: COMBINATORIAL STRUCTURES
• Exercises
• Bibliographic Notes
• References
• Index