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

基于控制集的双曲性计算

Hyperbolicity Computation through Dominating Sets

David Coudert, André Nusser, Laurent Viennot

摘要:

双曲性是与图在距离方面与树的相似程度相关的图参数。它的计算是具有挑战性的,因为主要的方法包括扫描图的所有四元组或使用快速矩阵乘法作为构建块,这两种方法对于大型图都不实用。在本文中,我们提出和评估的方法,使用一个层次的距离-k支配集,以减少搜索空间。与之前最好的实用算法相比,这种技术使我们能够计算具有前所未有的大小(高达一百万个节点)的图的双曲性,并将之前可实现的图的计算速度提高了高达3个数量级,同时减少了内存消耗高达23倍以上。

英文摘要:

Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix multiplication as building block, both are not practical for large graphs. In this paper, we propose and evaluate an approach that uses a hierarchy of distance-k dominating sets to reduce the search space. This technique, compared to the previous best practical algorithms, enables us to compute the hyperbolicity of graphs with unprecedented size (up to a million nodes) and speeds up the computation of previously attainable graphs by up to 3 orders of magnitude while reducing the memory consumption by up to more than a factor of 23.

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

↑