Combinatorial Algorithms
Auteur : Herbert S. Wilf
Date de publication : 1989-01-01
Éditeur : SIAM
Nombre de pages : 53
Résumé du livre
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.