Jump to ratings and reviews
Rate this book

Combinatorial Algorithms: An Update

Rate this book
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress 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.

53 pages, Paperback

First published January 1, 1987

About the author

Herbert S. Wilf

16 books3 followers

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
2 (100%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.