A preliminary analysis of the Distance Based Critical Node Problem.

Roberto Aringhieri,Andrea Grosso,Pierre Hosteins,Rosario Scatamacchia

Electronic Notes in Discrete Mathematics（2016）

引用 6|浏览4

暂无评分

摘要

We discuss how to develop efficient heuristics for the distance based critical node problem, that is the problem of deleting a subset of nodes from a graph G in such a way that the distance between each pair of nodes is as large as possible.

查看译文

关键词

Critical Node Problem,Graph Fragmentation,Shortest Paths

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要