4 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Moses Ganardi, Danny Hucke, Artur Jez +2
It is shown that every tree of size n over a fixed set of σ different ranked symbols can be decomposed (in linear time as well as in logspace) into $O\big(\frac{n}{\log_σn}\big…