Induced Subgraph Problem

Given a graph G=(V,E)G = (V, E) and a sequence of vertices from VV, for each vertex vv arriving at time tt, report all edges (u,v)∈E(u, v)\in E such that uu arrived at time t′t', where t′<tt' < t.

Parameters

  • nn: number of nodes
  • mm: number of edges

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions

Other relevant algorithms

Insuffient Data to display table