# Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing

arXiv: https://arxiv.org/abs/1904.03587 · HTML: https://mlsanity.com/paper/1904.03587/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Apr 2019.

## Built on by (most cited first, 1 of 1)

- [End-to-End Topology-Aware Machine Learning for Power System Reliability Assessment](https://mlsanity.com/paper/2205.14792/) (2022)

## Abstract (arXiv)

In this study, a graph-computing based grid splitting detection algorithm is proposed for contingency analysis in a graph-based EMS (Energy Management System). The graph model of a power system is established by storing its bus-branch information into the corresponding vertex objects and edge objects of the graph database. Numerical comparison to an up-to-date serial computing algorithm is also investigated. Online tests on a real power system of China State Grid with 2752 buses and 3290 branches show that a 6 times speedup can be achieved, which lays a good foundation for advanced contingency analysis.