Decremental Diameter (Graph Metrics)

Description

Determine the diameter of a graph decrementally, i.e. by removing edges and querying the resulting graph.

Related Problems

Generalizations: Diameter

Subproblem: 1-sensitive decremental diameter, constant sensitivity (4/3)-approximate incremental diameter

Related: Median, Radius, Diameter 2 vs 3, Diameter 3 vs 7, Approximate Diameter, 1-sensitive (4/3)-approximate decremental diameter, constant sensitivity (4/3)-approximate incremental diameter, 1-sensitive (4/3)-approximate decremental eccentricity

Parameters

$n$: number of nodes

$m$: number of edges

Table of Algorithms

Currently no algorithms in our database for the given problem.