arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.06827cs.DScs.CC
收藏

作为枚举问题的最短距离

Shortest Distances as Enumeration Problem

Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid

AI总结:

本文将单源和所有顶点对最短距离问题作为枚举问题研究,发现输出限制和枚举顺序对APSD复杂度影响显著,而对SSSD无影响。

摘要:

我们将单源最短距离(SSSD)和所有顶点对最短距离(APSD)问题作为枚举问题(在无权和整数权重图上)进行研究,这意味着元素 $(u, v, d(u, v))$ ——其中 $u$ 和 $v$ 是顶点,$d(u, v)$ 是最短距离——被逐一产生并无重复地列出。在 RAM 计算模型中,性能通过预处理时间和延迟来衡量,即两次连续输出之间经过的最大时间。这一视角揭示了特定类型的输出(例如,排除不可达对 $(u, v, \infty)$,或排除自身距离 $(u, u, 0)$)和枚举顺序(例如,按距离排序,按距离矩阵逐行排序)对 APSD 的复杂度有巨大影响,而对 SSSD 似乎没有影响。特别是,我们对于 APSD 表明,无输出限制的枚举可以实现平均度数级别的延迟。排除不可达对,或要求输出按距离排序,会将此延迟增加到最大度数级别。此外,对于加权图,如果不进行预处理或将自身距离视为输出,平均度数级别的延迟也是不可能的。相比之下,对于 SSSD,我们发现对于任何这些要求,无预处理的最大度数级别的延迟是可达到且不可避免的。

英文摘要:

We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the elements $(u, v, d(u, v))$ -- where $u$ and $v$ are vertices with shortest distance $d(u, v)$ -- are produced and listed one by one without repetition. The performance is measured in the RAM model of computation with respect to preprocessing time and delay, i.e., the maximum time that elapses between two consecutive outputs. This point of view reveals that specific types of output (e.g., excluding the non-reachable pairs $(u, v, \infty)$, or excluding the self-distances $(u, u, 0)$) and the order of enumeration (e.g., sorted by distance, sorted row-wise with respect to the distance matrix) have a huge impact on the complexity of APSD while they appear to have no effect on SSSD. In particular, we show for APSD that enumeration without output restrictions is possible with delay in the order of the average degree. Excluding non-reachable pairs, or requesting the output to be sorted by distance, increases this delay to the order of the maximum degree. Further, for weighted graphs, a delay in the order of the average degree is also not possible without preprocessing or considering self-distances as output. In contrast, for SSSD we find that a delay in the order of the maximum degree without preprocessing is attainable and unavoidable for any of these requirements.

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

↑