Combinatorial Algorithms
An Update
Seiten
1989
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-231-5 (ISBN)
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
Surveys some of the work that has been done since the appearance of the second edition of this book. 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.
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.
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.
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.
| Erscheint lt. Verlag | 30.9.1989 |
|---|---|
| Reihe/Serie | CBMS-NSF Regional Conference Series in Applied Mathematics |
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 151 x 228 mm |
| Gewicht | 120 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-89871-231-9 / 0898712319 |
| ISBN-13 | 978-0-89871-231-5 / 9780898712315 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
