2-sensitive incremental st-reach

Given a directed graph G=(V,E)G=(V,E) and vertices s,tVs, t \in V, incrementally determine wheteher tt is reachable from ss, with sensitivity 2, i.e. when 2 edges are added.

Parameters

  • nn: number of vertices
  • mm: number of edges

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table