Corpus ID: 17939098

Unbalanced subtrees in binary rooted ordered and un-ordered trees

@article{Disanto2012UnbalancedSI,
  title={Unbalanced subtrees in binary rooted ordered and un-ordered trees},
  author={Filippo Disanto},
  journal={arXiv: Combinatorics},
  year={2012}
}
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely unbalanced subtrees, where unbalancing is measured according to the so-called Colless's index. The size of the biggest unbalanced subtree becomes then a new parameter with respect to which we find several enumerations. 
1 Citations

Figures from this paper

Non-Contiguous Pattern Avoidance in Binary Trees
  • 22
  • PDF

References

SHOWING 1-6 OF 6 REFERENCES
Pattern avoidance in binary trees
  • E. Rowland
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2010
  • 39
  • PDF
Non-Contiguous Pattern Avoidance in Binary Trees
  • 22
  • PDF
Analytic Combinatorics
  • 2,785
  • PDF
SEARCHING FOR EVOLUTIONARY PATTERNS IN THE SHAPE OF A PHYLOGENETIC TREE
  • 221
Average Case Analysis of Algorithms on Sequences
  • 521
  • PDF