Maximum Strongly Connected Component (Strongly Connected Components)
Jump to navigation
Jump to search
Description
maintain: a directed graph, under: edge insertions/deletions, answer: what is the size of the largest SCC?
Related Problems
Related: Strongly Connected Components, Transitive Closure, Strong Connectivity (dynamic), 2 Strong Components (dynamic), Connected Subgraph
Parameters
$V$: number of vertices
$E$: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.