在StrSort模型中寻找欧拉路径
Finding Euler Tours in the StrSort Model
摘要:
我们提出了第一个算法在StrSort模型的无向图中找到欧拉旅游。该模型是半流模型的一种松弛形式。图是作为其边的流给出的,并且只能顺序读取,但是在对流进行遍历时,我们可以写出另一个流,这将是下一次遍历的输入。此外,流中的项在传递之间排序。该模型由Aggarwal等人于2004年引入。在这里,我们将这个模型应用于在图中找到欧拉巡回的问题(或决定图不允许欧拉巡回)。该算法分两步工作。在第一步中,进行单遍,同时需要线性(顶点数$n$)数量的RAM。在第二步中,当仅需要$\mathcal O(\log(n))$ RAM时,执行$\mathcal O(\log(n))$遍。我们使用一个改变的算法的Atallah和Vishkin从1984年发现欧拉旅游并行。它找到一个边不相交的电路的分区,并将它们排列在一棵树中,表示它们的连通性。然后根据该树合并电路。为了最小化所需的RAM量,我们避免了存储整个树的需要,并使用Aggarwal等人建议的技术来交换有关电路合并的信息。
英文摘要:
We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stream of its edges and can only be read sequentially, but while doing a pass over the stream we are allowed to write out another stream which will be the input for the next pass. In addition, items in the stream are sorted between passes. This model was introduced by Aggarwal et al. in 2004. Here we apply this model to the problem of finding an Euler tour in a graph (or to decide that the graph does not admit an Euler tour). The algorithm works in two steps. In the first step, a single pass is conducted while a linear (in the number of vertices $n$) amount of RAM is required. In the second step, $\mathcal O(\log(n))$ passes are conducted while only $\mathcal O(\log(n))$ RAM is required. We use an alteration of the algorithm of Atallah and Vishkin from 1984 for finding Euler tours in parallel. It finds a partition of edge-disjoint circuits and arranges them in a tree expressing their connectivity. Then the circuits are merged according to this tree. In order to minimize the needed amount of RAM, we evade the need to store the entire tree and use techniques suggested by Aggarwal et al. to exchange information concerning the merging of circuits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。