Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
tree enumeration
Description:
Tree enumeration is the mathematical counting and classification of trees, typically in graph theory and combinatorics.
Primary topic:
Advanced Combinatorial Mathematics (63%)
Related topics:
Advanced Combinatorial Mathematics (63%),
Graph theory and applications (10%)
OpenAlex ID:
keywords/tree-enumeration
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
1937
·
G. Pólya
·
Acta Mathematica
·
1,222
PDF
The Number of Trees
1948
·
Richard Otter
·
Annals of Mathematics
·
567
Counting labelled trees
1970
·
J. W. Moon
·
365
The probabilities of rooted tree-shapes generated by random bifurcation
1971
·
E. F. Harding
·
Advances in Applied Probability
·
341
Kinematic jump processes for monocular 3D human tracking
2003
·
C. Sminchisescu
, B. Triggs
·
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
·
289
Varieties of increasing trees
1992
·
François Bergeron
, Philippe Flajolet
, et al.
·
Lecture notes in computer science
·
250
Hopf-algebraic structure of families of trees
1989
·
Robert Grossman
, Richard G Larson
·
Journal of Algebra
·
225
On the Theory of the Analytical Forms called Trees
2009
·
Arthur Cayley
·
The Collected Mathematical Papers
·
193
Symbolic network analysis
1991
·
Pen-Min Lin
·
International Linear Collider
·
187
Lectures on Generating Functions
2003
·
S. Lando
·
Student mathematical library
·
160
The number of caterpillars
1973
·
Frank Harary
, Allen J. Schwenk
·
Discrete Mathematics
·
148
Hyperplane arrangements, interval orders, and trees.
1996
·
R P Stanley
·
Proceedings of the National Academy of Sciences
·
146
Generating Binary Trees Lexicographically
1977
·
F. Ruskey
, T. C. Hu
·
SIAM Journal on Computing
·
143
On the height of trees
1967
·
A. Rényi
, G. Szekeres
·
Journal of the Australian Mathematical Society
·
143
PDF
On the Number of Husimi Trees
1953
·
Frank Harary
, George E. Uhlenbeck
·
Proceedings of the National Academy of Sciences
·
143
PDF
Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire
1985
·
Jean-Luc Rémy
·
RAIRO Informatique théorique
·
136
PDF
Constant Time Generation of Rooted Trees
1980
·
Terry Beyer
, Sandra Mitchell Hedetniemi
·
SIAM Journal on Computing
·
126
The number of homeomorphically irreducible trees, and other species
1959
·
Frank Harary
, Geert Prins
·
Acta Mathematica
·
120
PDF
A unified approach to the approximate symbolic analysis of large analog integrated circuits
1996
·
Qicheng Yu
, C. Sechen
·
IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
·
107
A Note on the Enumeration and Listing of All Possible Trees in a Connected Linear Graph
1954
·
Horace M. Trent
·
Proceedings of the National Academy of Sciences
·
106
Constant Time Generation of Free Trees
1986
·
Robert Alan Wright
, Bruce Richmond
, et al.
·
SIAM Journal on Computing
·
105
Correspondences between plane trees and binary sequences
1970
·
David A. Klarner
·
Journal of Combinatorial Theory
·
105
PDF
Generation of Trees without Duplications
1965
·
W. Mayeda
, S. Seshu
·
IEEE Transactions on Circuit Theory
·
104
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
1977
·
Herbert S Wilf
·
Advances in Mathematics
·
101
PDF
A Simple Algorithm for Listing All the Trees of a Graph
1965
·
G. Minty
·
IEEE Transactions on Circuit Theory
·
94
Show more works
View as search
Works count:
1,034
Citation count:
12,720
Year
Topic
Type