Graphs and algorithms
Data structures and network algorithms
Data structures and network algorithms
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-cuts via network strength
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Submodular Functions in Problems of Synthesis of Networks
Cybernetics and Systems Analysis
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
DOS-Resistant Authentication with Client Puzzles
Revised Papers from the 8th International Workshop on Security Protocols
Two-Connected Networks with Rings of Bounded Cardinality
Computational Optimization and Applications
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Minimum cost subpartitions in graphs
Information Processing Letters
Clustering, community partition and disjoint spanning trees
ACM Transactions on Algorithms (TALG)
Computers and Operations Research
Transforming a graph into a 1-balanced graph
Discrete Applied Mathematics
A proof of the molecular conjecture
Proceedings of the twenty-fifth annual symposium on Computational geometry
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the use of admission control for better quality of security
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Network coding: an excellent approach for overloaded communication era
WSEAS TRANSACTIONS on COMMUNICATIONS
IEEE Wireless Communications
Design of network topology in an adversarial environment
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Note: Degree sequences and graphs with disjoint spanning trees
Discrete Applied Mathematics
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
A constrained binary knapsack approximation for shortest path network interdiction
Computers and Industrial Engineering
Polarity and the complexity of the shooting experiment
Discrete Optimization
Separation of partition inequalities with terminals
Discrete Optimization
Separating from the dominant of the spanning tree polytope
Operations Research Letters
Operations Research Letters
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
Separation of partition inequalities for the (1,2)-survivable network design problem
Operations Research Letters
Characterization of removable elements with respect to having k disjoint bases in a matroid
Discrete Applied Mathematics
| Hi-index | 0.07 |
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.