Combinatorial algorithms an update - Wilf, Herbert S. 1931-2012 (Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1989)
Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader
Includes bibliographical references (s. 43-45)
The original gray code -- Other gray codes -- Variations on the theme -- Choosing 2-samples -- Listing rooted trees -- Random selection of trees -- Listing free trees -- Generating random graphs
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
Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978. - Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College