Biconnected Components
Biconnected Components is a maximal subgraph of an undirected graph that remains connected after the removal of any single vertex, distinguishing it from general connected components by its two-vertex connectivity requirement.
67
Publications
11.1K
Citations
161
Authors
98
Institutions
Publications per year
2017–2026
8
Parents
67
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Depth-first search and linear graph algorithms
Robert E. Tarjan · 1971 · 655 citations
An Efficient Parallel Biconnectivity Algorithm
Robert E. Tarjan, Uzi Vishkin · SIAM Journal on Computing · 1985 · 526 citations
A sufficient condition for backtrack-bounded search
Eugene C. Freuder · Journal of the ACM · 1985 · 277 citations · Full text
1–5 of 67
161
7
h-index
4
h-index
2
h-index
2
h-index
2
h-index
1–5 of 161
98

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
1.3K citations
Princeton University
Princeton, United States
3 h-index
3 publications
205 citations

Cornell University
Ithaca, United States
3 h-index
3 publications
80 citations
Stanford University
Stanford, United States
3 h-index
3 publications
747 citations
University of Technology Sydney
Sydney, Australia
2 h-index
6 publications
102 citations
Roma Tre University
Rome, Italy
2 h-index
9 publications
397 citations
AT&T (United States)
Bedminster, United States
2 h-index
3 publications
1.2K citations

The University of Sydney
Sydney, Australia
2 h-index
6 publications
103 citations
1–8 of 98
6 publications · 6.8K citations
6
h-index
3 publications · 189 citations
3
h-index
3 publications · 89 citations
3
h-index
2 publications · 284 citations
2
h-index
2 publications · 55 citations
2
h-index
1–5