Diagram Complexity
Diagram Complexity is a metric that quantifies the intricacy of a causal loop diagram by accounting for the number of variables, causal links, feedback loops, and the density of interconnections among elements, thereby distinguishing it from simpler structural assessments by capturing the holistic cognitive and representational burden imposed by the diagram’s architecture.
35
Publications
1.3K
Citations
67
Authors
43
Institutions
Publications per year
2017–2026
5
Parents
35
Finiteness and CAT(0) properties of diagram groups
Daniel Farley · Topology · 2003 · 98 citations
Theoretical vs. Practical Complexity
Keng Siau, John Erickson, Lihyunn Lee · Journal of Database Management · 2005 · 67 citations
1–5 of 35
67
7
h-index
5
h-index
2
h-index
2
h-index
2
h-index
1–5 of 67
43
University of Castilla-La Mancha
Ciudad Real, Spain
7 h-index
16 publications
690 citations
New York University
New York, United States
3 h-index
4 publications
165 citations

Ghent University
Ghent, Belgium
2 h-index
3 publications
220 citations

Southeast University
Nanjing, China
2 h-index
3 publications
88 citations
Universidad de Valladolid
Valladolid, Spain
2 h-index
2 publications
46 citations

Romanian Academy
Bucharest, Romania
1 h-index
1 publications
40 citations

Keimyung University
Daegu, South Korea
1 h-index
1 publications
15 citations
Yichun University
Yichun, China
1 h-index
1 publications
37 citations
1–8 of 43
2 publications · 81 citations
2
h-index
DKE · 2 publications · 333 citations
2
h-index
1 publications · 40 citations
1
h-index
1 publications · 98 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5