Graph-theoretic Connectivity Analysis

Graph-Theoretic Connectivity Analysis is a graph-theoretic method that models spatial connectivity as a network of nodes and edges to analyze least-cost paths by evaluating topological relationships and flow efficiency within a structured graph representation.

102

Publications

5.7K

Citations

291

Authors

174

Institutions

Publications per year

2017–2026

22

Authors

291

  1. SK
    Steve Kirkland

    University of Regina, Canada

    3 publications · 191 citations

    3

    h-index

  2. RH
    Rong‐Xia Hao

    Beijing Jiaotong University, China

    3 publications · 98 citations

    3

    h-index

  3. MG
    Mei-Mei Gu

    Beijing Jiaotong University, China

    3 publications · 97 citations

    3

    h-index

  4. MH
    Monika Henzinger

    University of Vienna, Austria

    2 publications · 150 citations

    2

    h-index

  5. PS
    Philipp Schlegel

    University of Cambridge, United Kingdom

    2 publications · 289 citations

    2

    h-index

1–5 of 291

Venues

  1. Applied Mathematics and Computation

    5 publications · 286 citations

    5

    h-index

  2. Discrete Mathematics

    5 publications · 100 citations

    5

    h-index

  3. Journal of Graph Theory

    3 publications · 407 citations

    3

    h-index

  4. Discrete Applied Mathematics

    3 publications · 99 citations

    3

    h-index

  5. SIAM Journal on Computing

    2 publications · 122 citations

    2

    h-index

1–5