.png){kind=icon}
返回
Detecting critical nodes in sparse graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.08.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties of the network. In this paper, we focus on detecting critical nodes, or nodes whose deletion results in the minimum pair-wise connectivity among the remaining nodes. This problem, known as the CRITICAL NODE PROBLEM has applications in several fields including biomedicine, telecommunications, and military strategic planning. We show that the recognition version of the problem is NP-complete and derive a mathematical formulation based on integer linear programming. In addition, we propose a heuristic for the problem which exploits the combinatorial structure of the graph. The heuristic is then enhanced by the application of a local improvement method. A computational study is presented in which we apply the integer programming formulation and the heuristic to real and randomly generated data sets. For all instances tested. the heuristic is able to efficiently provide optimal solutions in a fraction of the time required by a commercial software package. Published by Elsevier Ltd.
Keyword:
Critical node detection
Heuristics
Integer linear programming
NP-complete
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏A Phase II Safety and Efficacy Study of the Vascular Endothelial Growth Factor Receptor Tyrosine Kinase Inhibitor Pazopanib in Patients With Metastatic Urothelial Cancer血管内皮生长因子受体酪氨酸激酶抑制剂帕唑帕尼治疗转移性尿路上皮癌的II期安全性和有效性研究
OAAI
OAAI分享收藏
查看更多内容