1-sensitive decremental diameter (Graph Metrics)

From Algorithm Wiki
Revision as of 12:04, 15 February 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

Description

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

Related Problems

Generalizations: Decremental Diameter

Subproblem: 1-sensitive (4/3)-approximate decremental diameter

Related: Median, Radius, Diameter, Diameter 2 vs 3, Diameter 3 vs 7, Approximate 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.

Reductions FROM Problem

Problem Implication Year Citation Reduction
Directed, Weighted APSP assume: APSP Hypothesis
then: target cannot be solved with preprocessing time $O(n^{3-\epsilon})$ and update and query times $O(n^{2-\epsilon})$ for any $\epsilon > {0}$ in undirected weighted graphs
2017 https://arxiv.org/pdf/1703.01638.pdf link