Sparsest cuts and bottlenecks in graphs
Discrete Applied Mathematics - Computational combinatiorics
Network reliability and algebraic structures
Network reliability and algebraic structures
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Stochastic Network Interdiction
Operations Research
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Sparsest cuts and concurrent flows in product graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Computational Complexity
Defending Critical Infrastructure
Interfaces
Survivable network design under optimal and heuristic interdiction scenarios
Journal of Global Optimization
Computers and Operations Research
Detecting Hidden Hierarchy in Terrorist Networks: Some Case Studies
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
Detecting critical nodes in sparse graphs
Computers and Operations Research
An O(n)-approximation algorithm for directed sparsest cut
Information Processing Letters
On approximation of new optimization methods for assessing network vulnerability
INFOCOM'10 Proceedings of the 29th conference on Information communications
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Complexity of the critical node problem over trees
Computers and Operations Research
Deterministic network interdiction
Mathematical and Computer Modelling: An International Journal
A decomposition approach for solving critical clique detection problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hi-index | 0.00 |
We examine variants of the critical node problem on specially structured graphs, which aim to identify a subset of nodes whose removal will maximally disconnect the graph. These problems lie at the intersection of network interdiction and graph theory research and are relevant to several practical optimization problems. The two different connectivity metrics that we consider regard the number of maximal connected components (which we attempt to maximize) and the largest component size (which we attempt to minimize). We develop optimal polynomial-time dynamic programming algorithms for solving these problems on tree structures and on series-parallel graphs, corresponding to each graph-connectivity metric. We also extend our discussion by considering node deletion costs, node weights, and solving the problems on generalizations of tree structures. Finally, we demonstrate the computational efficacy of our approach on randomly generated graph instances. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.