Parallel betweenness computation algorithms are proposed and implemented in a graph database for power system contingency selection. Principles of the graph database and graph computing are investigated for both node and edge betweenness computation. Experiments on the 118-bus system and a real power system show that speed-up can be achieved for both node and edge betweenness computation while the speeding effect on the latter is more remarkable due to the data retrieving advantages of the graph database on the power network data.

中文翻译：

---

用于权变选择的图数据库中的并行介数计算

在用于电力系统应急选择的图数据库中提出并实施并行介数计算算法。研究了图数据库和图计算的原理，用于节点和边介数计算。在118总线系统和实际电力系统上的实验表明，节点和边之间的计算都可以实现加速，而后者的加速效果由于图数据库在电力系统上的数据检索优势而更加显着。网络数据。