A polynomial algorithm for the extendability problem in bipartite graphs (Q293170): Difference between revisions

@@ Property / cites work @@
+Q2809944
@@ Property / cites work: Q2809944 / rank @@
+Normal rank
@@ Property / cites work @@
+Persistency in maximum cardinality bipartite matchings
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3960718
@@ Property / cites work: Q3960718 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3800093
@@ Property / cites work: Q3800093 / rank @@
+Normal rank