Connected Subgraph (Strongly Connected Components)
Revision as of 11:19, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Connected Subgraph (Strongly Connected Components)}} == Description == Subgraph connectivity asks us to maintainan understanding of connectivity under vertex updates: updates can turn vertices on and off, and queries refer to the subgraph induced by "on" vertices. (For instance, this is closer to applications in networks of routers, where node faults may occur.) == Related Problems == Related: Strongly Connected Components, Transitive Closure,...")
Description
Subgraph connectivity asks us to maintainan understanding of connectivity under vertex updates: updates can turn vertices on and off, and queries refer to the subgraph induced by "on" vertices. (For instance, this is closer to applications in networks of routers, where node faults may occur.)
Related Problems
Related: Strongly Connected Components, Transitive Closure, Maximum Strongly Connected Component, Strong Connectivity (dynamic), 2 Strong Components (dynamic)
Parameters
No parameters found.
Table of Algorithms
Currently no algorithms in our database for the given problem.