DeepAI AI Chat
Log In Sign Up

Parameterized Complexity of Diameter

by   Matthias Bentert, et al.
Berlin Institute of Technology (Technische Universität Berlin)

Diameter--the task of computing the length of a longest shortest path---is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no O(n^1.99)-time algorithm even in sparse graphs [Roditty and Williams, 2013]. To circumvent this lower bound we aim for algorithms with running time f(k)(n+m) where k is a parameter and f is a function as small as possible. For our choices of k we systematically explore a hierarchy of structural graph parameters.


page 1

page 2

page 3

page 4


Detours in Directed Graphs

We study two "above guarantee" versions of the classical Longest Path pr...

Distances in and Layering of a DAG

The diameter of an undirected unweighted graph G=(V,E) is the maximum va...

Improved SETH-hardness of unweighted Diameter

We prove that, assuming the Strong Exponential Time Hypothesis, for any ...

What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?

The Voronoi diagrams technique was introduced by Cabello to compute the ...

Reachability and Shortest Paths in the Broadcast CONGEST Model

In this paper we study the time complexity of the single-source reachabi...

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems

Despite persistent efforts, there is no known technique for obtaining un...