A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040): Difference between revisions

@@ Property / cites work @@
+Improved low-degree testing and its applications
@@ Property / cites work: Improved low-degree testing and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Coloured matchings in bipartite graphs
@@ Property / cites work: Coloured matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bicolored matchings in some classes of graphs
@@ Property / cites work: Bicolored matchings in some classes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some Matching Problems for Bipartite Graphs
@@ Property / cites work: Some Matching Problems for Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The labeled perfect matching in bipartite graphs
@@ Property / cites work: The labeled perfect matching in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Minimum perfect bipartite matchings and spanning trees under categorization
+Normal rank