Combinatorial algorithms: an update

Herbert S. Wilf9780898712315, 0898712319

This monograph is a survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees.

---

Table of contents :
Combinatorial Algorithms:An Update……Page 1
Contents……Page 8
Preface……Page 10
CHAPTER 1 The Original Gray Code……Page 12
CHAPTER 2 Other Gray Codes……Page 18
CHAPTER 3 Variations on the Theme……Page 28
CHAPTER 4 Choosing 2-Samples……Page 32
CHAPTER 5 Listing Rooted Trees……Page 34
CHAPTER 6 Random Selection of Free Trees……Page 38
CHAPTER 7 Listing Free Trees……Page 42
CHAPTER 8 Generating Random Graphs……Page 48
Bibliography……Page 54
Index……Page 58