Combinatorial Algorithms
An Update
Published on 30. September 1989
Book
Paperback/Softback
53 pages
978-0-89871-231-5 (ISBN)
Description
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.
Reviews / Votes
'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 ReviewsMore details
Series
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Product notice
Paperback (trade)
Dimensions
Height: 252 mm
Width: 171 mm
Thickness: 15 mm
Weight
121 gr
ISBN-13
978-0-89871-231-5 (9780898712315)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
The Original Gray CodeOther Gray Codes
Variations on the Theme
Choosing 2 Samples
Listing Rooted Trees
Random Selection of Trees
Listing Free Trees
Generating Random Graphs.
Variations on the Theme
Choosing 2 Samples
Listing Rooted Trees
Random Selection of Trees
Listing Free Trees
Generating Random Graphs.