Combinatorial Algorithms
An Update
£29.99
Part of CBMS-NSF Regional Conference Series in Applied Mathematics
- Author: Herbert S. Wilf, University of Pennsylvania
- Date Published: September 1989
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
- format: Paperback
- isbn: 9780898712315
£
29.99
Paperback
Looking for an inspection copy?
This title is not currently available on inspection
-
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 & endorsements
'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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: September 1989
- format: Paperback
- isbn: 9780898712315
- length: 53 pages
- dimensions: 252 x 171 x 15 mm
- weight: 0.121kg
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Table of Contents
The Original Gray Code
Other Gray Codes
Variations on the Theme
Choosing 2-Samples
Listing Rooted Trees
Random Selection of Trees
Listing Free Trees
Generating Random Graphs.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×