st-Reach (Vertex Reachability)

Description

Given a directed graph $G=(V,E)$ and vertices $s, t \in V$, determine wheteher $t$ is reachable from $s$.

Related Problems

Subproblem: constant sensitivity incremental ST-Reach, 1-sensitive incremental ss-reach, 2-sensitive incremental st-reach, ap-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.