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

Authors

67

  1. MG
    Marcela Genero

    University of Castilla-La Mancha, Spain

    7 publications · 284 citations

    7

    h-index

  2. MP
    Mario Piattini

    University of Castilla-La Mancha, Spain

    5 publications · 238 citations

    5

    h-index

  3. EM
    Esperanza Manso

    Universidad de Valladolid, Spain

    2 publications · 46 citations

    2

    h-index

  4. GP
    Geert Poels

    Ghent University, Belgium

    2 publications · 157 citations

    2

    h-index

  5. MP
    Mario Piatini

    University of Castilla-La Mancha, Spain

    2 publications · 46 citations

    2

    h-index

1–5 of 67

Venues

  1. Journal of Database Management

    2 publications · 81 citations

    2

    h-index

  2. Data & Knowledge Engineering

    DKE · 2 publications · 333 citations

    2

    h-index

  3. Journal of Logic and Computation

    1 publications · 40 citations

    1

    h-index

  4. Topology

    1 publications · 98 citations

    1

    h-index

  5. Journal of Electronics (China)

    1 publications · 14 citations

    1

    h-index

1–5