Complexity of a disjoint matching problem on bipartite graphs (Q2629777): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963591777
@@ Property / OpenAlex ID: W2963591777 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06157
@@ Property / arXiv ID: 1506.06157 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Complexity of a 3-dimensional assignment problem
@@ Property / cites work: Complexity of a 3-dimensional assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+On complexity of special maximum matchings constructing
+Normal rank
@@ Property / cites work @@
+Disjoint matchings of graphs
@@ Property / cites work: Disjoint matchings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs with prescribed valencies
@@ Property / cites work: Subgraphs with prescribed valencies / rank @@
+Normal rank