The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612): Difference between revisions

@@ 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.1016/j.endm.2010.05.070
+Normal rank
@@ Property / OpenAlex ID @@
+W1981370779
@@ Property / OpenAlex ID: W1981370779 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization
@@ Property / cites work: Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of the Core of Combinatorial Optimization Games
+Normal rank
@@ Property / cites work @@
+Totally balanced combinatorial optimization games
@@ Property / cites work: Totally balanced combinatorial optimization games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3143963
@@ Property / cites work: Q3143963 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank