Bibliographic Details
| Title: |
Considering the isolation set problem |
| Authors: |
Herbranson, Travis J.1, Deckro, Richard F.2 richard.deckro@afit.edu, Chrissis, James W.3, Hamill, Jonathan (Todd)4 |
| Source: |
European Journal of Operational Research. Jun2013, Vol. 227 Issue 2, p268-274. 7p. |
| Subjects: |
Cyberterrorism, Netcentric computing, Problem solving, Set theory, Computer networks |
| Abstract: |
Abstract: Given a network, G =[N, E] the Isolation Set Problem (ISP) finds the set of arcs, D ⊆ 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. [Copyright &y& Elsevier] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
