Spectral Graph Theory and Network Dependability

被引：16

作者：

Torres, Alvaro ^{[1
]}

Anders, George ^{[2
]}

机构：

[1] Univ Los Andes, Bogota, Colombia

[2] Tech Univ Lodz, Lodz, Poland

来源：

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DEPENDABILITY OF COMPUTER SYSTEMS | 2009年

关键词：

D O I：

10.1109/DepCoS-RELCOMEX.2009.52

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described. The procedure is illustrated on a practical numerical example.

引用

页码：356 / 363

页数：8

共 11 条

[1]

AMIN M, 2000, IEEE COMPUT, P44

[2]

Amin SM, 2015, IEEE power and energy magazine, DOI [10.1109/MPAE.2005.1507024, 10.1109/MPAE.2005.150702]

[3]

[Anonymous], P 41 HAW INT C SYST

[4]

Avizienis Algirdas., 2004, IEEE T DEPENDABLE SE, V1

[5]

FAN C, 2007, ICCM, V11, P1

[6] Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph [J].

Hogben, L .

ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2005, 14 :12-31

[7]

NEWMAN MEJ, MATH NETWORKS, P3

[8]

OSTROWSKI AM, 1960, P NAS, V46

[9] Normalized cuts and image segmentation [J].

Shi, JB ;

Malik, J .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2000, 22 (08) :888-905

[10]

Spielman D., SPECTRAL GRAPH THEOR

← 1 2 →