.png){kind=icon}
返回
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.02.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper the problem of critical node detection (CNDP) is approached using population-based incremental learning (an estimation of distribution algorithm) and simulated annealing optimization algorithms using a combinatorial unranking-based problem representation. This representation is space-efficient and alleviates the need for any repair mechanisms. CNDP is a very recently proposed problem that aims to identify a vertex set V' subset of V of k > 0 nodes from a given graph G = (V,E) such that G(V\V') has minimum pairwise connectivity. Numerous practical applications for this problem exist, including pandemic disease mitigation, computer security and anti-terrorism. In order to test the proposed heuristics 16 benchmark random graph structures are additionally proposed that utilize Erdos-Renyi, Watts-Strogatz, Forest Fire and Barabasi-Albert models. Each of these models presents different network characteristics, yielding variations in problem difficulty. The relative merits of the two proposed approaches are compared and it is found that the population-based incremental learning approach, using a windowed perturbation operator is able to outperform the proposed simulated annealing method. (c) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Critical node detection
Complex networks
Random graph
Simulated annealing
Population-based incremental learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏
A novel snoRNA (U73) is encoded within the introns of the human and mouse ribosomal protein S3a genes.png)
Gene
GeneIF0
PREAI
分享收藏分享收藏
查看更多内容