Parameterized Complexity of Diameter
Matthias Bentert, André Nichterlein · Algorithmica · 2022
Abstract 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})$$ O ( n 1.99 ) -time algorithm even in sparse graphs (Roditty L, Williams, VV in Fast approximation algorithms for the diameter and radius of sparse graphs. In: Proceedings of the 45th Symposium on Theory of Computing Conference (STOC ’13), pp 515–524. ACM, 2013). To circumvent this lower bound, we investigate which parameters allow for running times of the form $$f(k) (n+m)$$ f ( k ) ( n + m ) where k is the respective parameter and f is a computable function. To this end, we systematically explore a hierarchy of structural graph parameters.