\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2012.06.002
+Normal rank
@@ Property / OpenAlex ID @@
+W4298220245
@@ Property / OpenAlex ID: W4298220245 / rank @@
+Normal rank
@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+Crown reductions for the minimum weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Minimum \(d\)-blockers and \(d\)-transversals in graphs
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm for weighted stable sets in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Blockers and transversals
@@ Property / cites work: Blockers and transversals / rank @@
+Normal rank