A Genetic Algorithm for a class of Critical Node Problems.

Roberto Aringhieri,Andrea Grosso,Pierre Hosteins

Electronic Notes in Discrete Mathematics（2016）

引用 9|浏览19

暂无评分

摘要

In this paper, we deal with two different variants of the Critical Node Problem, designing a flexible genetic algorithm for tackling them both. The results are compared with the best known results available in the literature.

查看译文

关键词

Critical Node Problem,Cardinality-Constrained,graph fragmentation,genetic algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要