论文标题
快速搜索未加权动态图中最短路径的投影
On the quick search for the shortest paths in an unweighted dynamic graph by its projections in brief
论文作者
论文摘要
首次提出的：一种用于表示计算机存储器中图的投影的方法，以及基于其快速搜索未加权动态图中最短路径的描述。投影描述的空间复杂性不超过$（d + 1）\ times n $单词，其中$ d $是直径，而$ n $是图的顶点。在两个顶点之间找到一个最短路径的时间难度不超过D步骤，而在采样机词的基本时间的持续时间内。该解决方案可以应用于计算机网络和超级计算机的时间延迟关键路由协议。
For the first time proposed: a method for representing the projections of a graph in computer memory and a description based on it of a quick search for shortest paths in unweighted dynamic graphs. The spatial complexity of the projection description does not exceed $(d + 1)\times n$ words, where $d$ is the diameter and $n$ is the number of vertices of the graph. The temporal difficulty of finding one shortest path between two vertices does not exceed d steps with the duration of elementary time of sampling a machine word. The solution can be applied in time delay-critical routing protocols of computer networks and supercomputers.
