Cyclomatic Complexity

Cyclomatic Complexity is a software metric that quantifies the logical complexity of a program by measuring the number of linearly independent paths through its source code.

161

Publications

7K

Citations

392

Authors

201

Institutions

Publications per year

2017–2026

31

Variants

Mccabe's Cyclomatic Complexity

Authors

392

  1. TY
    Tongjiang Yan

    China University of Petroleum, East China, China

    3 publications · 65 citations

    3

    h-index

  2. DP
    David P. Tegarden

    Virginia Tech, United States

    3 publications · 91 citations

    3

    h-index

  3. DG
    Dror G. Feitelson

    Hebrew University of Jerusalem, Israel

    3 publications · 61 citations

    3

    h-index

  4. PR
    Praveen Ranjan Srivastava

    Indian Institute of Management Rohtak, India

    3 publications · 98 citations

    3

    h-index

  5. JV
    Jurgen Vinju

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 90 citations

    3

    h-index

1–5 of 392

Venues

  1. IEEE Transactions on Software Engineering

    TSE · 10 publications · 1.8K citations

    10

    h-index

  2. ACM SIGSOFT Software Engineering Notes

    SEN · 5 publications · 117 citations

    5

    h-index

  3. Designs Codes and Cryptography

    4 publications · 130 citations

    4

    h-index

  4. ACM SIGPLAN Notices

    4 publications · 312 citations

    4

    h-index

  5. Software Practice and Experience

    3 publications · 103 citations

    3

    h-index

1–5