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

近似最优空间有效的深度优先搜索算法

Nearly Optimal Space Efficient Algorithm for Depth First Search

Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma

摘要:

我们设计了一个空间有效的算法执行深度优先搜索遍历(DFS)的图在$O(m+n\log^* n)$时间使用$O(n)$位的空间。虽然一个正常的DFS算法的结果是一个DFS树(如果图是连接的),我们的空间边界不允许我们甚至存储这样的树。然而,我们的算法正确地输出DFS树的所有边。之前的最佳算法(使用$O(n)$工作空间)花费了$O(m \log n)$时间(Asano,Izumi,Kiyomi,Konagaya,Ono,Otachi,Schweitzer,Tarui,Uehara(ISAAC 2014)和Elmasry,Hagerup,Krammer(STACS 2015))。在这一领域留下的主要问题是设计更快的算法DFS使用$O(n)$位的空间。我们的算法回答了这个问题,因为它有一个接近最佳的运行时间(因为DFS需要$O(m+n)$时间,即使没有空间限制)。

英文摘要:

We design a space-efficient algorithm for performing depth-first search traversal(DFS) of a graph in $O(m+n\log^* n)$ time using $O(n)$ bits of space. While a normal DFS algorithm results in a DFS-tree (in case the graph is connected), our space bounds do not permit us even to store such a tree. However, our algorithm correctly outputs all edges of the DFS-tree. The previous best algorithm (which used $O(n)$ working space) took $O(m \log n)$ time (Asano, Izumi, Kiyomi, Konagaya, Ono, Otachi, Schweitzer, Tarui, Uehara (ISAAC 2014) and Elmasry, Hagerup, Krammer (STACS 2015)). The main open question left behind in this area was to design faster algorithm for DFS using $O(n)$ bits of space. Our algorithm answers this open question as it has a nearly optimal running time (as the DFS takes $O(m+n)$ time even if there is no space restriction).

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

↑