arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04660cs.DMcs.CCcs.DScs.NI
收藏

P中证书及图的半二次时间计算半径、直径和所有eccentricities

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

Kent State University(肯特州立大学);University of Bucharest, Faculty of Mathematics and Computer Science(布加勒斯特大学数学与计算机科学学院);National Institute for Research and Development in Informatics, Romania(罗马尼亚信息与计算发展国家研究所);Inria, DI ENS, Paris, France(法国国家信息与自动化研究所,巴黎高等师范学院)

Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot

AI总结:

本文提出了一种基于证书的算法,用于在次二次时间内计算图的半径、直径和所有eccentricities,并通过实验验证了其有效性。

摘要:

在细粒度复杂性背景下,我们研究了证书概念,以使多项式时间算法更快。我们特别针对已知在合理假设下具有二次时间下界的问题,即半径(最小eccentricity)、直径(最大eccentricity)以及所有eccentricity的计算。在每种情况下,我们引入了证书的概念,即一个特定的节点集合,当这个集合的大小为次线性时,可以以次二次时间推导出所有eccentricities的适当界限。对于半径、直径和所有eccentricities存在小证书是SETH基下界的一个障碍。我们确实证明,对于具有有界大小证书的图类,存在随机的次二次时间算法,分别计算半径、直径和所有eccentricities。此外,这些证书的概念与通过单源最短路径查询探测图的算法紧密相关,并允许解释文献中实际的半径和直径算法的效率。特别是,我们的正式化使经典直径计算方法的新型对偶分析成为可能。基于我们对这些问题的新见解,我们引入了与eccentricity计算相关的几种新算法技术,并提出了具有理论保证的半径、直径和所有eccentricities的算法,这些保证与某些图参数有关。这通过在各种现实世界图上进行的实验结果得到补充,显示这些参数在实践中似乎较低。最后,我们获得了在输入图是幂律随机图、具有低倍数维度、低双曲性、是弦图、满足某些Helly型性质或具有有界asteroidal数的情况下,更精确的结果。

英文摘要:

In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity), diameter (maximum eccentricity), and all-eccentricity computations for which quadratic-time lower bounds are known under plausible conjectures. In each case, we introduce a notion of certificate as a specific set of nodes from which appropriate bounds on all eccentricities can be derived in subquadratic time when this set has sublinear size. The existence of small certificates for radius, diameter and all eccentricities is a barrier against SETH-based lower bounds for these problems. We indeed prove that for graph classes with certificates of bounded size, there exist randomized subquadratic-time algorithms for computing the radius, the diameter, and all eccentricities respectively. Moreover, these notions of certificates are tightly related to algorithms probing the graph through one-to-all distance queries and allow to explain the efficiency of practical radius and diameter algorithms from the literature. In particular, our formalization enables a novel primal-dual analysis of a classical approach for diameter computation. Based on our novel insights for these problems, we introduce several new algorithmic techniques related to eccentricity computation and propose algorithms for radius, diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters. This is complemented by experimental results on various types of real-world graphs showing that these parameters appear to be low in practice. Finally, we obtain refined results in the case where the input graph is a power-law random graph, has low doubling dimension, has low hyperbolicity, is chordal, satisfies some Helly-type property, or has bounded asteroidal number.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑