Constant sensitivity incremental ST-Reach: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:constant sensitivity incremental ST-Reach (Vertex Reachability)}} == Description == Given a graph $G=(V,E)$, incrementally determine whether each node $s\in S\subseteq V$ can reach a node $t\in T \subseteq V$, with a constant sensitivity of $K(\epsilon, t)$, i.e. when $K(\epsilon, t)$ edges are added. == Related Problems == Generalizations: ST-Reach Related: #SSR, sensitive incremental #SSR, st-Reach, 1-sensitive incremental ss-reac...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
$n$: number of vertices | |||
m: number of edges | |||
$m$: number of edges | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 09:28, 10 April 2023
Description
Given a graph $G=(V,E)$, incrementally determine whether each node $s\in S\subseteq V$ can reach a node $t\in T \subseteq V$, with a constant sensitivity of $K(\epsilon, t)$, i.e. when $K(\epsilon, t)$ edges are added.
Related Problems
Generalizations: ST-Reach
Related: #SSR, sensitive incremental #SSR, st-Reach, 1-sensitive incremental ss-reach, 2-sensitive incremental st-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.