Strong Connectivity (dynamic) (Strongly Connected Components)
Revision as of 11:19, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Strong Connectivity (dynamic) (Strongly Connected Components)}} == Description == maintain: a directed graph, under edge insertions/deletions, answer: is the graph strongly connected? == Related Problems == Related: Strongly Connected Components, Transitive Closure, Maximum Strongly Connected Component, 2 Strong Components (dynamic), Connected Subgraph == Parameters == No parameters found. == Table of Algorithms == Currently...")
Description
maintain: a directed graph, under edge insertions/deletions, answer: is the graph strongly connected?
Related Problems
Related: Strongly Connected Components, Transitive Closure, Maximum Strongly Connected Component, 2 Strong Components (dynamic), Connected Subgraph
Parameters
No parameters found.
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| Triangle Detection | let $\gamma = (w-{1})/(w+{1}) \in ({1}/{3},{0.408})$ if: to-time: $O(m^{2\gamma-\epsilon})$ update and query times even after O(m^{1+\gamma-\epsilon}) preprocessing time for any $\epsilon > {0}$ then: Strong Triangle is false |
2014 | https://ieeexplore.ieee.org/abstract/document/6979028?casa_token=daaoBjrHUa4AAAAA:DCjk_WMWZ5Is6KvGpmS8a2bL9LskvV0P1zEG4U2u-Tm_C8sixu1w65OpTyjml1HEpaikXhtYsg | link |