On the Independent Set Interdiction Problem (Q5006560): Difference between revisions

@@ Property / author @@
-Gholam Hassan Shirdel
@@ Property / author: Gholam Hassan Shirdel / rank @@
-Normal rank
@@ Property / author @@
+Gholam Hassan Shirdel
@@ Property / author: Gholam Hassan Shirdel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.5614/ejgta.2015.3.2.2
+Normal rank
@@ Property / OpenAlex ID @@
+W2178467139
@@ Property / OpenAlex ID: W2178467139 / rank @@
+Normal rank
@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Nodes in a Flow Network
+Normal rank
@@ Property / cites work @@
+Q4897499
@@ Property / cites work: Q4897499 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank