1-sensitive (4/3)-approximate decremental diameter
Approximate the diameter of a graph decrementally within a factor of 4/3, with a sensativity of 1, i.e. when a single edge is removed.
Parameters
- : number of nodes
- : 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