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.”
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Cambridge University Press
2026-01-01
|
| Serie: | Forum of Mathematics, Sigma |
| Soggetti: | |
| Accesso online: | https://www.cambridge.org/core/product/identifier/S2050509426102187/type/journal_article |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|