Related references
Note: Only part of the references are listed.Fast Screening of Vulnerable Transmission Lines in Power Grids: A PageRank-Based Approach
Zhiyuan Ma et al.
IEEE TRANSACTIONS ON SMART GRID (2019)
Electricity consumption behaviour analysis based on adaptive weighted-feature K-means-AP clustering
Chunyan Li et al.
IET GENERATION TRANSMISSION & DISTRIBUTION (2019)
Identifying critical risks of cascading failures in power systems
Hehong Zhang et al.
IET GENERATION TRANSMISSION & DISTRIBUTION (2019)
Method for finding the important nodes of an electrical power system based on weighted-SALSA algorithm
Junqi Geng et al.
IET GENERATION TRANSMISSION & DISTRIBUTION (2019)
Fast Searching Strategy for Critical Cascading Paths Toward Blackouts
Zhiyuan Ma et al.
IEEE ACCESS (2018)
Evaluation method of node importance for power grid considering inflow and outflow power
Huifang Wang et al.
JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY (2017)
Cascading failure model in power grids using the complex network theory
Fan Wenli et al.
IET GENERATION TRANSMISSION & DISTRIBUTION (2016)
Method for evaluating the importance of power grid nodes based on PageRank algorithm
Canbing Li et al.
IET GENERATION TRANSMISSION & DISTRIBUTION (2014)
An electrical betweenness approach for vulnerability assessment of power grids considering the capacity of generators and load
Kai Wang et al.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2011)
Towards Decentralization: A Topological Investigation of the Medium and Low Voltage Grids
Giuliano Andrea Pagani et al.
IEEE TRANSACTIONS ON SMART GRID (2011)
Node centrality in weighted networks: Generalizing degree and shortest paths
Tore Opsahl et al.
SOCIAL NETWORKS (2010)
An Improved OPA Model and Blackout Risk Assessment
Shengwei Mei et al.
IEEE TRANSACTIONS ON POWER SYSTEMS (2009)
A loading-dependent model of probabilistic cascading failure
I Dobson et al.
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES (2005)
Finding the most vital node of a shortest path
E Nardelli et al.
THEORETICAL COMPUTER SCIENCE (2003)
Share Paper
