Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
labeled trees
Description:
Labeled trees are trees whose vertices or edges carry assigned labels, studied in combinatorics and graph theory.
Primary topic:
Advanced Combinatorial Mathematics (37%)
Related topics:
Advanced Combinatorial Mathematics (37%),
Algorithms and Data Compression (11%),
semigroups and automata theory (8%)
OpenAlex ID:
keywords/labeled-trees
A survey on tree edit distance and related problems
2005
·
Philip Bille
·
Theoretical Computer Science
·
904
PDF
Une théorie combinatoire des séries formelles
1981
·
André Joyal
·
Advances in Mathematics
·
778
PDF
Efficient keyword search for smallest LCAs in XML databases
2005
·
Yu Xu
, Yannis Papakonstantinou
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
486
Combinatorial algorithms: generation, enumeration, and search
2000
·
Choice Reviews Online
·
396
Counting labelled trees
1970
·
J. W. Moon
·
365
A complete inference system for a class of regular behaviours
1984
·
Robin Milner
·
Journal of Computer and System Sciences
·
361
Tree Languages
1997
·
Ferenc Gécseg
, Magnus Steinby
·
Springer eBooks
·
345
The probabilities of rooted tree-shapes generated by random bifurcation
1971
·
E. F. Harding
·
Advances in Applied Probability
·
341
Enumerative Combinatorics
2023
·
Richard Stanley
·
Cambridge University Press eBooks
·
333
Frequent Subtree Mining - An Overview
2004
·
Yün Chi
, Richard R. Muntz
, et al.
·
Fundamenta Informaticae
·
312
Planar Maps as Labeled Mobiles
2004
·
J. Bouttier
, P. Di Francesco
, et al.
·
The Electronic Journal of Combinatorics
·
281
PDF
Comparison of labeled trees with valency three
1971
·
D.F Robinson
·
Journal of Combinatorial Theory Series B
·
253
PDF
Alignment of trees — an alternative to tree edit
1995
·
T Jiang
·
Theoretical Computer Science
·
240
PDF
Ordered and Unordered Tree Inclusion
1995
·
Pekka Kilpeläinen
, Heikki Mannila
·
SIAM Journal on Computing
·
217
TreeFinder: a first step towards XML data mining
2003
·
A. Termier
, M.-C. Rousset
, et al.
·
Proceedings
·
208
Compressing and indexing labeled trees, with applications
2009
·
Paolo Ferragina
, Fabrizio Luccio
, et al.
·
Journal of the ACM
·
195
Alignment of trees — an alternative to tree edit
1995
·
Tao Jiang
, Lusheng Wang
, et al.
·
Theoretical Computer Science
·
188
Keyword proximity search in XML trees
2006
·
V. Hristidis
, N. Koudas
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
182
Discovering Frequent Substructures in Large Unordered Trees
2003
·
Tatsuya Asai
, Hiroki Arimura
, et al.
·
Lecture notes in computer science
·
182
PDF
Hyperplane arrangements, interval orders, and trees.
1996
·
R P Stanley
·
Proceedings of the National Academy of Sciences
·
146
Efficiently Mining Frequent Embedded Unordered Trees
2004
·
Mohammed J. Zaki
·
Fundamenta Informaticae
·
145
On the height of trees
1967
·
A. Rényi
, G. Szekeres
·
Journal of the Australian Mathematical Society
·
143
PDF
Structuring labeled trees for optimal succinctness, and beyond
2005
·
P. Ferragina
, F. Luccio
, et al.
·
Annual Symposium on Foundations of Computer Science
·
142
The Discrete Acyclic Digraph Markov Model in Data Mining
2002
·
J.R. Castelo Valdueza
·
Utrecht University Repository (Utrecht University)
·
140
Coalescent Random Forests
1999
·
Jim Pitman
·
Journal of Combinatorial Theory Series A
·
137
PDF
Show more works
View as search
Works count:
728
Citation count:
15,160
Year
Topic
Type