• Corpus ID: 18907887

A general bijective algorithm for trees ( enumeration of trees / partition / species / Lagrange inversion )

@inproceedings{ChenAGB,
  title={A general bijective algorithm for trees ( enumeration of trees / partition / species / Lagrange inversion )},
  author={William Y. C. Chen}
}
Trees are combinatorial structures that arise naturally in diverse applications. They occur in branching decision structures, taxonomy, computer languages, combinatorial optimization, parsing of sentences, and cluster expansions of statistical mechanics. Intuitively, a tree is a collection of branches connected at nodes. Formally, it can be defmed as a connected graph without cycles. Schroder trees, introduced in this paper, are a class of trees for which the set of subtrees at any vertex is… 

References

SHOWING 1-10 OF 12 REFERENCES

Combinatorics on Words

  • T. Harju
  • Computer Science, Mathematics
  • 2004
Words (strings of symbols) are fundamental in computer processing, and nearly all computer software use algorithms on strings.

Counting labelled trees

La publication de la conference de John Moon, Counting Labelled Trees, est un autre jalon de l'histoire de la Societe Mathematique du Canada. Nous esperons que cette monographie sera la premiere

The Art in Computer Programming

Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.

J. Comb. Theory

  • J. Comb. Theory
  • 1970

Advanced Combinatorics (Reidel, Dordrecht , The Netherlands)

  • Advanced Combinatorics (Reidel, Dordrecht , The Netherlands)
  • 1974

J. Comb. Theory Ser. A

  • J. Comb. Theory Ser. A
  • 1989

Edinburgh Math. Notes

  • Edinburgh Math. Notes
  • 1941

Indagationes Math

  • Indagationes Math
  • 1964

Adv. Appl. Math

  • Adv. Appl. Math
  • 1989