1 option
Combinatorial algorithms : an update / Herbert S. Wilf.
- Format:
- Book
- Author/Creator:
- Wilf, Herbert S., 1931-
- Series:
- CBMS-NSF regional conference series in applied mathematics ; 55.
- CBMS-NSF regional conference series in applied mathematics ; 55
- Language:
- English
- Subjects (All):
- Combinatorial analysis.
- Algorithms.
- Physical Description:
- 1 electronic text (v, 47 p.) : ill., digital file.
- Place of Publication:
- Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1989.
- Language Note:
- English
- System Details:
- Mode of access: World Wide Web.
- System requirements: Adobe Acrobat Reader.
- Summary:
- 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.
- Notes:
- Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978.
- Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College.
- Includes bibliographical references (p. 43-45).
- Title from title screen, viewed 04/05/2011.
- ISBN:
- 1-61197-016-4
- Publisher Number:
- CB55 SIAM
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.