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.

Скачать книгу бесплатно (djvu, 686 Kb)

---

Читать «Combinatorial Algorithms : An Update (CBMS-NSF Regional Conference Series in Applied Mathematics)»