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.
Produktinformation
- Utgivningsdatum1989-09-30
- Mått151 x 228 x 14 mm
- Vikt120 g
- FormatHäftad
- SpråkEngelska
- SerieCBMS-NSF Regional Conference Series in Applied Mathematics
- Antal sidor53
- FörlagSociety for Industrial & Applied Mathematics,U.S.
- ISBN9780898712315