An algorithm for uniform generation of unlabeled (Pólya) trees
Pólya trees are unlabeled rooted trees on n vertices. This paper gives a new way to generate Pólya trees, that conjecturally is very efficient. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with “reality.”
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Cambridge University Press
2026-01-01
|
| Col·lecció: | Forum of Mathematics, Sigma |
| Matèries: | |
| Accés en línia: | https://www.cambridge.org/core/product/identifier/S2050509426102187/type/journal_article |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|