10% off all books and free delivery over £40
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Combinatorial Algorithms

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Combinatorial Algorithms Synopsis

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.

About This Edition

ISBN: 9780898712315
Publication date:
Author: Herbert S Wilf, Albert Nijenhuis, Conference Board of the Mathematical Sciences, National Science Foundation US
Publisher: Society for Industrial and Applied Mathematics an imprint of SIAM - Society for Industrial and Applied Mathematics
Format: Paperback
Pagination: 47 pages
Series: CBMS-NSF Regional Conference Series in Applied Mathematics
Genres: Applied mathematics
Combinatorics and graph theory