A maximum dicut in a digraph induced by a minimal dominating set (Q5090164): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4256384527
@@ Property / OpenAlex ID: W4256384527 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
+Normal rank
@@ Property / cites work @@
+Max-Cut Under Graph Constraints
@@ Property / cites work: Max-Cut Under Graph Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of upper fractional domination
+Normal rank
@@ Property / cites work @@
+On the max min vertex cover problem
@@ Property / cites work: On the max min vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank