Tree-based Representation
Tree-Based Representation is a data structure organization method in which each disjoint set is implemented as a tree, where nodes represent elements and parent-child relationships define set membership and connectivity through union and find operations.
819
Publications
43.9K
Citations
2.2K
Authors
923
Institutions
Publications per year
2017–2026
239
Parents
819
Markov Models in Medical Decision Making
Frank A. Sonnenberg, J. Robert Beck · Medical Decision Making · 1993 · 2.4K citations
Deep Forest: Towards An Alternative to Deep Neural Networks
Zhi‐Hua Zhou, Ji Feng · 2017 · 900 citations · Full text
Space-efficient static trees and graphs
G. Jacobson · 1989 · 649 citations
A Linear Recognition Algorithm for Cographs
Derek G. Corneil, Yehoshua Perl, Laura K. Stewart · SIAM Journal on Computing · 1985 · 642 citations
1–5 of 819
2.2K
7
h-index
École Pour l'Informatique et les Techniques Avancées, France
6 publications · 239 citations
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 2.2K
923

Centre National de la Recherche Scientifique
Paris, France
11 h-index
22 publications
734 citations
Université Paris Cité
Paris, France
9 h-index
19 publications
565 citations
University of California, Los Angeles
Los Angeles, United States
9 h-index
20 publications
459 citations

TU Wien
Vienna, Austria
9 h-index
21 publications
2.2K citations

Victoria University of Wellington
Wellington, New Zealand
9 h-index
29 publications
1.4K citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
12 publications
522 citations

Chinese Academy of Sciences
Beijing, China
8 h-index
26 publications
938 citations

City University of Hong Kong
Hong Kong, Hong Kong
8 h-index
15 publications
640 citations
1–8 of 923
Repository · 21 publications · 732 citations
15
h-index
8 publications · 901 citations
8
h-index
8 publications · 252 citations
8
h-index
8 publications · 241 citations
8
h-index
8 publications · 335 citations
8
h-index
1–5