Affiliation:
1. Carleton Univ., Ottawa, Ont., Canada
Abstract
In a nonnegative edge-weighted network, the weight of an edge represents the effort required by an attacker to destroy the edge, and the attacker derives a benefit for each new component created by destroying edges. The attacker may want to minimize over subsets of edges the difference between (or the ratio of) the effort incurred and the benefit received. This idea leads to the definition of the “strength” of the network, a measure of the resistance of the network to such attacks. Efficient algorithms for the optimal attack problem, the problem of computing the strength, and the problem of finding a minimum cost “reinforcement” to achieve a desired strength are given. These problems are also solved for a different model, in which the attacker wants to separate vertices from a fixed central vertex.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference21 articles.
1. Oper;BROWN J. R.;Res.,1979
2. CHV ~TAL V.Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215-228. CHV ~TAL V.Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215-228.
3. membership in matroid polyhedra;CUNNINGHAM W. H.;J. Comb. Theory B,1984
4. and matroid polyhedra;CUNNINGHAM W. H.;Networks,1985
5. On nonlinear fractional programming;DINKELBACH W;Management Sci.,1967
Cited by
168 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献