A derandomized approximation algorithm for the critical node detection problem (Q336925): Difference between revisions

@@ 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 @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+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 @@
+Q2921652
@@ Property / cites work: Q2921652 / rank @@
+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 @@
+Complexity of the critical node problem over trees
+Normal rank
@@ Property / cites work @@
+Branch and cut algorithms for detecting critical nodes in undirected graphs
+Normal rank
@@ Property / cites work @@
+Cut Problems in Graphs with a Budget Constraint
@@ Property / cites work: Cut Problems in Graphs with a Budget Constraint / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate max-flow min-(multi)cut theorems and their applications
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+How the science of complex networks can help developing strategies against terrorism
+Normal rank
@@ Property / cites work @@
+The Complexity and Approximability of Minimum Contamination Problems
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
+Normal rank
@@ Property / cites work @@
+Collective dynamics of ‘small-world’ networks
@@ Property / cites work: Collective dynamics of ‘small-world’ networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886046
@@ Property / cites work: Q4886046 / rank @@
+Normal rank