A new application of graph theory for coordination of protective relays
暂无分享,去创建一个
The coordination of protective relays of multiloop networks is a tedious and time consuming process. The complicated part of this process is the determination of a set of relays referred to as the break-point set (BPS), with a minimal size to start the coordination procedure. This letter introduces a new graph-theoretical approach to determine the BPS. This method reduces the complexity of the problem, by exploiting the available sparsity of the dependencies among relays in protection systems.
[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[2] Pradipta Kishore Dash,et al. An application of functional dependencies to the topological analysis of protection schemes , 1992 .
[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms (Working Paper) , 1971, SWAT.
[4] Graeme Smith,et al. The identification of a minimal feedback vertex set of a directed graph , 1975 .