SIAM Homepage | Search Catalog | New Books | Author Index | Series Index | Title Index | View My Shopping Cart



The catalog and shopping cart are hosted for SIAM by EasyCart. Your transaction is secure. If you have any questions about your order, contact siambooks@siam.org.

Purchase Now!

Combinatorial Algorithms: An UpdateCombinatorial Algorithms: An Update

Herbert S. Wilf



CBMS-NSF Regional Conference Series in Applied Mathematics 55


"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, 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 2-Samples; Listing Rooted Trees; Random Selection of Trees; Listing Free Trees; Generating Random Graphs.

1989 / vi + 47 pages / Softcover / ISBN-13: 978-0-898712-31-5 / ISBN-10: 0-89871-231-9 /
List Price $38.00 / SIAM/CBMS Member Price $26.60 / Order Code CB55
Price
Quantity desired
   



Search our catalog for:

Shopping cart provided by: EasyCart.com
Select quantity and list or member price and then click the "Click to Order" button to add books to your shopping cart.
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Auckland, NZ.)