Graph Connectivity Analysis
Graph Connectivity Analysis is a graph-theoretic analytical method that assesses the structural coherence and reachability properties within a graph by identifying connected components, bridges, articulation points, and resilience to node or edge failures, thereby distinguishing itself from other graph analysis techniques through its focus on topological integrity and network robustness.
84
Publications
3.2K
Citations
198
Authors
131
Institutions
Publications per year
2017–2026
23
Parents
84
A note on finding the bridges of a graph
Robert E. Tarjan · Information Processing Letters · 1974 · 233 citations
1–5 of 84
198
6
h-index
5
h-index
5
h-index
3
h-index
2
h-index
1–5 of 198
131
Beijing Jiaotong University
Beijing, China
6 h-index
12 publications
288 citations
National Taipei University of Business
Taipei, Taiwan
5 h-index
5 publications
121 citations
Charles University
Prague, Czechia
4 h-index
4 publications
97 citations

National Institute of Technology Calicut
Kozhikode, India
3 h-index
5 publications
132 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
269 citations
Fujian Normal University
Fuzhou, China
3 h-index
7 publications
383 citations

Karnatak University
Dharwad, India
2 h-index
4 publications
152 citations
Stanford University
Stanford, United States
2 h-index
3 publications
80 citations
1–8 of 131
IJFCS · 4 publications · 80 citations
4
h-index
4 publications · 201 citations
4
h-index
3 publications · 108 citations
3
h-index
3 publications · 71 citations
3
h-index
JOIN · 2 publications · 55 citations
2
h-index
1–5