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.
@article{arxiv.2006.16339,
title = {Parallel Betweenness Computation in Graph Database for Contingency Selection},
author = {Yongli Zhu and Renchang Dai and Guangyi Liu},
journal= {arXiv preprint arXiv:2006.16339},
year = {2020}
}
Comments
This paper has been accepted by the 2020 IEEE PES General Meeting