Decomposition Trees
Decomposition Trees is a hierarchical modeling framework that recursively partitions a system into its constituent subsystems or components, distinguished by its tree-structured representation of decomposition relationships where each node signifies a decomposition step and its children represent the resulting subproblems or subsystems.
32
Publications
3.3K
Citations
71
Authors
37
Institutions
Publications per year
2017–2026
3
Variants
Decomposition Tree
Parents
32
Matrix Representation of Trees, Redundancy, and Weighting
Fredrik Ronquist · Systematic Biology · 1996 · 75 citations · Full text
1–5 of 32
71
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 71
37

Uppsala University
Uppsala, Sweden
2 h-index
2 publications
85 citations

Osnabrück University
Osnabrück, Germany
2 h-index
6 publications
462 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
62 citations
Fraunhofer Institute for Intelligent Analysis and Information Systems
Sankt Augustin, Germany
2 h-index
2 publications
154 citations
Shandong Institute of Automation
Jinan, China
1 h-index
1 publications
11 citations

Data61
Sydney, Australia
1 h-index
1 publications
32 citations

Chinese Academy of Sciences
Beijing, China
1 h-index
3 publications
33 citations
California Institute of Technology
Pasadena, United States
1 h-index
2 publications
124 citations
1–8 of 37
2 publications · 85 citations
2
h-index
2 publications · 54 citations
2
h-index
Conference · 2 publications · 154 citations
2
h-index
Repository · 1 publications · 180 citations
1
h-index
1 publications · 74 citations
1
h-index
1–5