字RAM上的线性时间就地DFS和BFS
Linear-Time In-Place DFS and BFS on the Word RAM
摘要:
我们提出了一个到位的深度优先搜索(DFS)和到位的广度优先搜索(BFS),运行在字RAM上的线性时间,这样,如果输入图的邻接数组中给出的排序顺序,输入后恢复运行的算法。为了获得我们的结果,我们使用的表示用于存储给定的图的属性,并显示几个线性时间就地图变换从一个表示到另一个。
英文摘要:
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time such that, if the adjacency arrays of the input graph are given in a sorted order, the input is restored after running the algorithm. To obtain our results we use properties of the representation used to store the given graph and show several linear-time in-place graph transformations from one representation into another.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。