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

时态图探索

On Temporal Graph Exploration

Thomas Erlebach, Michael Hoffmann, Frank Kammer

摘要:

时间图是其中边集可以从一个时间步到下一个时间步改变的图。时间图探索问题TEXP是计算时间图的最重要的探索调度的问题,即,从给定的起始节点开始,访问图的所有节点,并且具有最小到达时间的时间遍历。在本文的第一部分中,我们只考虑在每个时间步连接的无向时间图。对于这样的时间图与$n$节点,我们表明,它是\NP -很难近似TEXP的比率$O(n^{1-\varepsilon})$为每个$\varepsilon>0$。我们还提供了一个明确的建设的时间图,需要$Θ(n^2)$的时间步长进行探索。在本文的第二部分中,我们仍然考虑在每个时间步中连接的时间图,但我们假设底层图(即包含至少一个时间步中存在于时间图中的所有边的图)属于特定的一类图。在其他结果中,我们表明,时间图可以探索在$O(n^{1.5}k^{1.5}\log n)$时间步长,如果底层图形具有树宽$k$,在$O(n^{1.8}\log n)$时间步长,如果底层图形是平面的,在$O(n\log^3 n)$时间步长,如果底层图形是一个$2\times n$网格。在本文的第三部分中,我们考虑设置在未来的时间步长的图形是未知的,并在线构建的勘探时间表。我们取代了连通性假设较弱的假设,并表明$m$边时间图定期目前的边缘和概率目前的边缘可以探索在线$O(m)$时间步骤和$O(m \log n)$时间步骤,分别具有高概率。我们最后表明,后者的结果可以用来获得一个分布式算法的闲聊问题的随机时间图。

英文摘要:

A temporal graph is a graph in which the edge set can change from one time step to the next. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. In the first part of the paper, we consider only undirected temporal graphs that are connected at each time step. For such temporal graphs with $n$ nodes, we show that it is \NP-hard to approximate TEXP with ratio $O(n^{1-\varepsilon})$ for every $\varepsilon>0$. We also provide an explicit construction of temporal graphs that require $Θ(n^2)$ time steps to be explored. In the second part of the paper, we still consider temporal graphs that are connected in each time step, but we assume that the underlying graph (i.e. the graph that contains all edges that are present in the temporal graph in at least one time step) belongs to a specific class of graphs. Among other results, we show that temporal graphs can be explored in $O(n^{1.5}k^{1.5}\log n)$ time steps if the underlying graph has treewidth $k$, in $O(n^{1.8}\log n)$ time steps if the underlying graph is planar, and in $O(n\log^3 n)$ time steps if the underlying graph is a $2\times n$ grid. In the third part of the paper, we consider settings where the graphs in future time steps are not known and the exploration schedule is constructed online. We replace the connectedness assumption by a weaker assumption and show that $m$-edge temporal graphs with regularly present edges and with probabilistically present edges can be explored online in $O(m)$ time steps and $O(m \log n)$ time steps with high probability, respectively. We finally show that the latter result can be used to obtain a distributed algorithm for the gossiping problem in random temporal graphs.

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

↑