Directed st-Reach

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

Parameters

$n$ : number of vertices
$m$ : number of edges

Related Problems

Dynamic ST-Reach

sensitive incremental ST-Reach

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table