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

Authors

161

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    7 publications · 7.6K citations

    7

    h-index

  2. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    4 publications · 786 citations

    4

    h-index

  3. MH
    Monika Henzinger

    University of Vienna, Austria

    2 publications · 40 citations

    2

    h-index

  4. FF
    Fabrizio Frati

    Roma Tre University, Italy

    2 publications · 89 citations

    2

    h-index

  5. MR
    Monika Rauch

    Cornell University, United States

    2 publications · 79 citations

    2

    h-index

1–5 of 161

Venues

  1. SIAM Journal on Computing

    6 publications · 6.8K citations

    6

    h-index

  2. Algorithmica

    3 publications · 189 citations

    3

    h-index

  3. Theoretical Computer Science

    3 publications · 89 citations

    3

    h-index

  4. Information Processing Letters

    2 publications · 284 citations

    2

    h-index

  5. Journal of Parallel and Distributed Computing

    2 publications · 55 citations

    2

    h-index

1–5