2-sensitive incremental st-reach (Vertex Reachability)
Revision as of 10:29, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2-sensitive incremental st-reach (Vertex Reachability)}} == Description == Given a directed graph $G=(V,E)$ and vertices $s, t \in V$, incrementally determine wheteher $t$ is reachable from $s$, with sensitivity 2, i.e. when 2 edges are added. == Related Problems == Generalizations: st-Reach Related: #SSR, sensitive incremental #SSR, ST-Reach, constant sensitivity incremental ST-Reach, 1-sensitive incremental ss-reach, ap-re...")
Description
Given a directed graph $G=(V,E)$ and vertices $s, t \in V$, incrementally determine wheteher $t$ is reachable from $s$, with sensitivity 2, i.e. when 2 edges are added.
Related Problems
Generalizations: st-Reach
Related: #SSR, sensitive incremental #SSR, ST-Reach, constant sensitivity incremental ST-Reach, 1-sensitive incremental ss-reach, ap-reach
Parameters
n: number of vertices m: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| BMM | assume: BMM then: combinatorial algorithms cannot solve target with preprocessing time $O(n^{3-\epsilon})$, and update and query times $O(n^{2-\epsilon})$ for any $\epsilon > {0}$ |
2017 | https://arxiv.org/pdf/1703.01638.pdf | link |