Combinatorial Algorithms

An Update

Herbert S. Wilf (Autor)

Buch | Softcover

53 Seiten

1987
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-231-5 (ISBN)

Titel z.Zt. nicht lieferbar
Versandkostenfrei
Auch auf Rechnung

Artikel merken

Covers some of the work done since the second edition of Combinatorial Algorithms. Topics include: 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.

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.

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.

Reihe/Serie	CBMS-NSF Regional Conference Series in Applied Mathematics
Zusatzinfo	Worked examples or Exercises
Verlagsort	New York
Sprache	englisch
Maße	171 x 252 mm
Gewicht	121 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-89871-231-9 / 0898712319
ISBN-13	978-0-89871-231-5 / 9780898712315
Zustand	Neuware