.png){kind=icon}
返回
Considering the isolation set problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.11.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a network, G = [N,E] the Isolation Set Problem (ISP) finds the set of arcs, D c E, that when removed will separate a predefined set of r distinguished nodes [2]. This involves eliminating connections from a specific set of nodes to the rest of a network. In our increasingly interconnected network-centric world, this might be isolating various units from Headquarters; isolating a portion of a computer network to disrupt communications or to quarantine a virus or some other form of cyber attack; or isolating a cell or sub-group in a terrorist or dark network, for example. The research presented here reviews the ISP, addresses the totally unimodular character of the ISP, offers a node consolidation method, provides for the inclusion of nodes in the cut sets, and introduces resource constraints to the ISP. An example is presented to illustrate the approach. Published by Elsevier B.V.
Keyword:
Networks
Isolation Set Problem
Integer Program
Network Centric Warfare
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Quantum Confinement and End-Sealing Effects for Highly Sensitive and Stable Nitrogen Dioxide Detection: Homogeneous Integration of Ti3C2Tx-Based Flexible Gas Sensors.png)
ACS Sensors
ACS SensorsIF0
PREAI
分享收藏