ST-Reach

Given a graph $G=(V,E)$ , determine whether each node $s\in S\subseteq V$ can reach a node $t\in T \subseteq V$ .

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