Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027): Difference between revisions

@@ Property / cites work @@
+Optimal interdiction of a supply network
@@ Property / cites work: Optimal interdiction of a supply network / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Links in Flow Networks
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+The multi-terminal maximum-flow network-interdiction problem
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+Q5408296
@@ Property / cites work: Q5408296 / rank @@
+Normal rank