DeepAI AI Chat

Improved SETH-hardness of unweighted Diameter

08/12/2020

∙

by Ray Li, et al.

∙

∙

We prove that, assuming the Strong Exponential Time Hypothesis, for any δ>0, a 5/3-δ approximation of the diameter of an undirected unweighted graph with n vertices needs n^3/2-o(1) time. This result improves on lower bounds of Backurs, Roditty, Segal, Vassilevska-Williams, and Wein.

page 1

page 2

page 3

page 4

∙ 01/07/2021

4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n^4/3

We show, assuming the Strong Exponential Time Hypothesis, that for every...

0 Édouard Bonnet, et al. ∙

∙ 07/14/2023

On Diameter Approximation in Directed Graphs

Computing the diameter of a graph, i.e. the largest distance, is a funda...

0 Amir Abboud, et al. ∙

∙ 08/26/2020

Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio

We show, assuming the Strong Exponential Time Hypothesis, that for every...

0 Édouard Bonnet, et al. ∙

∙ 11/24/2017

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter

A model of computation that is widely used in the formal analysis of rea...

0 Krishnendu Chatterjee, et al. ∙

∙ 02/27/2018

Parameterized Complexity of Diameter

Diameter--the task of computing the length of a longest shortest path---...

0 Matthias Bentert, et al. ∙

∙ 03/07/2022

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

We initiate the study of diameter computation in geometric intersection ...

0 Karl Bringmann, et al. ∙

∙ 10/21/2022

A Simple Deterministic Distributed Low-Diameter Clustering

We give a simple, local process for nodes in an undirected graph to form...

0 Václav Rozhoň, et al. ∙