
1989 / vi + 47 pages / Softcover / ISBN: 9780898712315 / List Price $40.00 / SIAM/CBMS Member Price $28.00 / Order Code CB55
"The theorems and algorithms are all described in an intuitive yet precise manner, and the monograph would be an easytoread introduction to the area for any graduate student of mathematics or computer science." – Peter Eades, Mathematical Reviews, Issue 90g, 1990
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.
Contents
The Original Gray Code; Other Gray Codes; Variations on the Theme; Choosing 2Samples; Listing Rooted Trees; Random Selection of Trees; Listing Free Trees; Generating Random Graphs.
ISBN: 9780898712315