Häftad, Engelska, 1989
Combinatorial Algorithms
An Update
Del i serien CBMS-NSF Regional Conference Series in Applied Mathematics
584 kr
Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.
Beskrivning
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
- Utgivningsdatum: 1989-09-30
- Mått: 151 x 228 x 14 mm
- Vikt: 120 g
- Format: Häftad
- Språk: Engelska
- Serie: CBMS-NSF Regional Conference Series in Applied Mathematics
- Antal sidor: 53
- Förlag: Society for Industrial & Applied Mathematics,U.S.
- ISBN: 9780898712315
Utforska kategorier
Recensioner i media
'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 Reviews
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.