constant sensitivity (4/3)-approximate incremental diameter

Approximate the diameter of a graph decrementally within a factor of 4/3, with a constant sensitivity of K(ϵ,t)K(\epsilon, t), i.e. when a K(ϵ,t)K(\epsilon, t) edges are removed.

Parameters

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

Related Problems

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