跳至主導覽
跳至搜尋
跳過主要內容
國立陽明交通大學研發優勢分析平台 首頁
English
中文
首頁
人員
單位
研究成果
計畫
獎項
活動
貴重儀器
影響
按專業知識、姓名或所屬機構搜尋
Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal Attacks
Yang Lou
*
, Lin Wang, Shengli Xie, Guanrong Chen
*
*
此作品的通信作者
資訊工程學系
研究成果
:
Article
›
同行評審
5
引文 斯高帕斯(Scopus)
總覽
指紋
指紋
深入研究「Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal Attacks」主題。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Graph Network
100%
Removal Attack
100%
Controllability Robustness
100%
Edge Removal
100%
Random Edge
100%
Random Directed Graphs
100%
Random Graphs
57%
Hybrid Approximation
57%
Phase Approximation
28%
Two-threshold
14%
Approximation Methods
14%
Generation Mechanism
14%
Robust Performance
14%
Networked Systems
14%
Network Controllability
14%
Node Removal
14%
Attack Simulation
14%
Sparse Random Graphs
14%
Mathematics
Edge
100%
Random Graphs
100%
Approximates
14%
Approximation Method
14%
Median
14%
Computer Science
Random Graphs
100%
Approximation (Algorithm)
85%
Engineering
Controllability
100%
Simulation Result
16%
Nodes
16%
Similarities
16%
Conventional Time
16%