Maximum Strongly Connected Component (Strongly Connected Components)
Revision as of 10:19, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Strongly Connected Component (Strongly Connected Components)}} == 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 == No parameters found. == Table of Algorithms == Curre...")
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
No parameters found.
Table of Algorithms
Currently no algorithms in our database for the given problem.