Connectivity Algorithms is a class of graph algorithms designed to determine and maintain dynamic connectivity relationships among vertices in a graph, distinguished by their reliance on disjoint set data structures to efficiently support union and find operations in the presence of edge insertions or deletions.
735
Publications
38.6K
Citations
1.3K
Authors
572
Institutions
Publications per year
2017–2026
112
Publications
735
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Congruent Graphs and the Connectivity of Graphs
Hassler Whitney · American Journal of Mathematics · 1932 · 855 citations
Depth-first search and linear graph algorithms
Robert E. Tarjan · 1971 · 655 citations
An <i>r</i>-Dimensional Quadratic Placement Algorithm
Kenneth M. Hall · Management Science · 1970 · 528 citations
1–5 of 735
Authors
1.3K
- XL
13
h-index
- ZN
12
h-index
- GF
12
h-index
- RE
10
h-index
- MH
10
h-index
1–5 of 1.3K
Institutions
572
Carnegie Mellon University
Pittsburgh, United States
15 h-index
34 publications
1.4K citations
Nankai University
Tianjin, China
14 h-index
38 publications
1.4K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
12 h-index
32 publications
713 citations
Tel Aviv University
Tel Aviv, Israel
12 h-index
16 publications
978 citations
Open University of Israel
Raanana, Israel
12 h-index
13 publications
375 citations
University of Michigan
Ann Arbor, United States
11 h-index
18 publications
663 citations
Kyoto University
Kyoto, Japan
11 h-index
16 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
17 publications
485 citations
1–8 of 572
Venues
- SIAM Journal on Computing
30 publications · 8K citations
22
h-index
- Discrete Applied Mathematics
47 publications · 1.4K citations
22
h-index
- Discrete Mathematics
35 publications · 1K citations
18
h-index
- Journal of Graph Theory
26 publications · 660 citations
17
h-index
- Networks
19 publications · 987 citations
16
h-index
1–5