Concepedia

Strongly Connected Components

Strongly Connected Components is a graph-theoretic construct that partitions a directed graph into maximal subgraphs where every pair of vertices is mutually reachable via directed paths.

355

Publications

23.6K

Citations

704

Authors

413

Institutions

Publications per year

2017–2026

52

Variants

Sccs

Parents

Publications

355

Depth-First Search and Linear Graph Algorithms

Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations

, , +16

Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics

Wenwu Yu, Guanrong Chen, Ming Cao et al. · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2009 · 1.1K citations · Full text

, , +17

Connected Components in Random Graphs with Given Expected Degree Sequences

Fan Chung, Linyuan Lü · Annals of Combinatorics · 2002 · 963 citations

, , +11

Depth-first search and linear graph algorithms

Robert E. Tarjan · 1971 · 655 citations

, , +16

Strongly regular graphs, partial geometries and partially balanced designs

R. C. Bose · Pacific Journal of Mathematics · 1963 · 523 citations · Full text

, , +10

1–5 of 355

Authors

704

  1. JB
    Jørgen Bang‐Jensen

    University of Southern Denmark, Denmark

    9 publications · 244 citations

    9

    h-index

  2. HL
    Hong‐Jian Lai

    West Virginia University, United States

    8 publications · 113 citations

    8

    h-index

  3. CT
    Carsten Thomassen

    Technical University of Denmark, Denmark

    5 publications · 265 citations

    5

    h-index

  4. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    4 publications · 56 citations

    4

    h-index

  5. NP
    Norbert Polat

    Université Jean Moulin Lyon III, France

    4 publications · 59 citations

    4

    h-index

1–5 of 704

Institutions

413

  1. West Virginia University

    Morgantown, United States

    8 h-index

    11 publications

    149 citations

  2. Centre National de la Recherche Scientifique

    Paris, France

    8 h-index

    11 publications

    152 citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    7 h-index

    13 publications

    649 citations

  4. Université Claude Bernard Lyon 1

    Villeurbanne, France

    6 h-index

    8 publications

    218 citations

  5. Tel Aviv University

    Tel Aviv, Israel

    6 h-index

    6 publications

    271 citations

  6. National University of Singapore

    Singapore, Singapore

    5 h-index

    7 publications

    123 citations

  7. University of California San Diego

    San Diego, United States

    5 h-index

    9 publications

    2.3K citations

  8. Aarhus University

    Aarhus, Denmark

    5 h-index

    5 publications

    62 citations

1–8 of 413

Venues

  1. Discrete Mathematics

    41 publications · 1.2K citations

    18

    h-index

  2. Discrete Applied Mathematics

    12 publications · 520 citations

    12

    h-index

  3. European Journal of Combinatorics

    12 publications · 287 citations

    11

    h-index

  4. Journal of Graph Theory

    11 publications · 251 citations

    10

    h-index

  5. Information Processing Letters

    9 publications · 626 citations

    9

    h-index

1–5