Combinatorial algorithms: an update

Free Download

Authors:

Series: CBMS-NSF Regional Conference Series in Applied Mathematics

ISBN: 9780898712315, 0898712319

Size: 338 kB (345713 bytes)

Pages: 58/58

File format:

Language:

Publishing Year:

Category:

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.

Reviews

There are no reviews yet.

Be the first to review “Combinatorial algorithms: an update”
Shopping Cart
Scroll to Top