Author:
Bentert Matthias,Nichterlein André
Abstract
AbstractDiameter—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.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献