Combinatorial algorithms: an update
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Wilf, Herbert S. 1931-2012 (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1989
Schriftenreihe:CBMS-NSF regional conference series in applied mathematics 55
Schlagworte:
Online-Zugang:TUM01
UBW01
UBY01
UER01
Volltext
Beschreibung:Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader
Includes bibliographical references (s. 43-45)
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
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
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
Beschreibung:1 Online-Ressource (v, 47 Seiten)
ISBN:0898712319
9780898712315
DOI:10.1137/1.9781611970166

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen