Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688): Difference between revisions

@@ Property / cites work @@
+Design of survivable networks with vulnerability constraints
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Hop‐level flow formulation for the survivable network design with hop constraints problem
+Normal rank
@@ Property / cites work @@
+Branch-and-cut methods for the network design problem with vulnerability constraints
+Normal rank
@@ Property / cites work @@
+Detecting critical nodes in sparse graphs
@@ Property / cites work: Detecting critical nodes in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cardinality-Constrained Critical Node Detection Problem
+Normal rank
@@ Property / cites work @@
+Methods for removing links in a network to minimize the spread of infections
+Normal rank
@@ Property / cites work @@
+Identifying sets of key players in a social network
+Normal rank
@@ Property / cites work @@
+Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
+Normal rank
@@ Property / cites work @@
+Branch and cut algorithms for detecting critical nodes in undirected graphs
+Normal rank
@@ Property / cites work @@
+Exact identification of critical nodes in sparse networks via new compact formulations
+Normal rank
@@ Property / cites work @@
+Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+Complexity of the critical node problem over trees
+Normal rank
@@ Property / cites work @@
+Hybrid constructive heuristics for the critical node problem
+Normal rank
@@ Property / cites work @@
+Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Centrality Analysis for Modified Lattices
@@ Property / cites work: Centrality Analysis for Modified Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+An integer programming framework for critical elements detection in graphs
+Normal rank
@@ Property / cites work @@
+Information theory perspective on network robustness
+Normal rank
@@ Property / cites work @@
+Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
+Normal rank
@@ Property / cites work @@
+Efficiency of scale-free networks: Error and attack tolerance
+Normal rank
@@ Property / cites work @@
+Q3140399
@@ Property / cites work: Q3140399 / rank @@
+Normal rank
@@ Property / cites work @@
+Community structure in social and biological networks
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank