1-sensitive decremental diameter

Determine the diameter of a graph decrementally, with a sensativity of 1, i.e. when a single edge is removed.

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 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table