Journal of the ACM (JACM)
Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Between Min Cut and Graph Bisection
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Partitioning Avoidance in Mobile Ad Hoc Networks Using Network Survivability Concepts
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory
On pairwise connectivity of wireless multihop networks
International Journal of Security and Networks
Detecting critical nodes in sparse graphs
Computers and Operations Research
Exploiting the robustness on power-law networks
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Branch and cut algorithms for detecting critical nodes in undirected graphs
Computational Optimization and Applications
An overview of algorithms for network survivability
ISRN Communications and Networking
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers and Operations Research
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Assessing network vulnerability before potential disruptive events such as natural disasters or malicious attacks is vital for network planning and risk management. It enables us to seek and safeguard against most destructive scenarios in which the overall network connectivity falls dramatically. Existing vulnerability assessments mainly focus on investigating the inhomogeneous properties of graph elements, node degree for example, however, these measures and the corresponding heuristic solutions can provide neither an accurate evaluation over general network topologies, nor performance guarantees to large scale networks. To this end, in this paper, we investigate a measure called pairwise connectivity and formulate this vulnerability assessment problem as a new graph-theoretical optimization problem called β-disruptor, which aims to discover the set of critical node/edges, whose removal results in the maximum decline of the global pairwise connectivity. Our results consist of the NP-Completeness and inapproximability proof of this problem, an O(log n log log n) pseudo-approximation algorithm for detecting the set of critical nodes and an O(log1.5 n) pseudoapproximation algorithm for detecting the set of critical edges. In addition, we devise an efficient heuristic algorithm and validate the performance of the our model and algorithms through extensive simulations.