Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898712315 Academic Inspection Copy

Combinatorial Algorithms

An Update
Description
Table of
Contents
Reviews
Google
Preview
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.
The Original Gray CodeOther Gray Codes Variations on the Theme Choosing 2 Samples Listing Rooted Trees Random Selection of Trees Listing Free Trees Generating Random Graphs.
'The theorems and algorithms are all described in an intuitive yet precise manner, and the monograph would be an easy-to-read introduction to the area for any graduate student of mathematics or computer science.' Peter Eades, Mathematical Reviews
Google Preview content