arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.04091cs.DS
收藏

在W-流模型中一次寻找Euler旅行的时间复杂度为O(n log(n))RAM

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM

Christian Glazik, Jan Schiemann, Anand Srivastav

摘要:

本文研究了W流模型中无向图G的欧拉游问题,其内存复杂度为O(n个polylog(n)),其中n个分别是m是节点的数量,G的边缘我们的主要结果是第一个单程W流算法计算G的欧拉之旅,其形式为仅具有O(n log(n))RAM的边缘后继函数,这对于该设置是最佳的(例如,Sun和Woodruff(2015))。这个模型中以前最著名的结果是由Demetrescu et al.(2010)隐式给出的,Atallah和Vishkin(1984)的并行算法在相同的RAM限制下使用O(m/n)遍。对于具有ω(n)边的图,这是非常数的。我们的总体方法是将边缘划分为边缘不相交的循环,并合并循环,直到实现单个欧拉巡回。注意,在W流模型中,这样的合并远不是显而易见的,因为有限的RAM一次只允许处理恒定数量的周期。这迫使我们合并部分不再存在于RAM中的周期。此外,在边离开RAM之后,不能改变边的后继。因此,我们必须不断地输出边缘及其指定的后继者,而不知道边缘和周期的出现。我们解决这个问题,一个特殊的边缘交换技术,其中每个节点的两个特定的边缘是足够的合并旅游,而无需在RAM中的所有边缘。在数学上,这是控制的结构结果的空间中的某些等价类对应的循环和表征相关的后继功能。例如,我们给出的条件下,交换的边缘继任者导致合并的等价类。

英文摘要:

We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. Our main result is the first one pass W-Streaming algorithm computing an Euler tour of G in the form of an edge successor function with only O(n log(n)) RAM which is optimal for this setting (e.g., Sun and Woodruff (2015)). The previously best-known result in this model is implicitly given by Demetrescu et al. (2010) with the parallel algorithm of Atallah and Vishkin (1984) using O(m/n) passes under the same RAM limitation. For graphs with ω(n) edges this is non-constant. Our overall approach is to partition the edges into edge-disjoint cycles and to merge the cycles until a single Euler tour is achieved. Note that in the W-Streaming model such a merging is far from being obvious as the limited RAM allows the processing of only a constant number of cycles at once. This enforces us to merge cycles that partially are no longer present in RAM. Furthermore, the successor of an edge cannot be changed after the edge has left RAM. So, we steadily have to output edges and their designated successors, not knowing the appearance of edges and cycles yet to come. We solve this problem with a special edge swapping technique, for which two certain edges per node are sufficient to merge tours without having all of their edges in RAM. Mathematically, this is controlled by structural results on the space of certain equivalence classes corresponding to cycles and the characterization of associated successor functions. For example, we give conditions under which the swapping of edge successors leads to a merging of equivalence classes.

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

↑