Combinatorial Algorithms: An Update

Front Cover
SIAM, 1989 - Mathematics - 47 pages
0 Reviews
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.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

References to this book

All Book Search results »