Skip to main content
Louigi Addario-Berry's user avatar
Louigi Addario-Berry's user avatar
Louigi Addario-Berry's user avatar
Louigi Addario-Berry
  • Member for 14 years, 11 months
  • Last seen more than a month ago
answered
Loading…
comment
Is there a simple inductive procedure for generating labeled trees uniformly at random, without direct recourse to Prüfer sequences?
The tree $T_n$ has exactly $n$ nodes, so if $T_n$ is a subtree of $T_{n+1}$ then $T_{n+1}$ must have been created by adding only a single leaf, not lots of leaves.
Loading…
awarded
Loading…
awarded
awarded
Loading…
awarded
awarded
1
11 12 13 14
15