Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions

@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / 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 @@
+Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
+Normal rank
@@ Property / cites work @@
+Algorithms for dense graphs and networks on the random access computer
+Normal rank
@@ Property / cites work @@
+Persistency in maximum cardinality bipartite matchings
+Normal rank
@@ Property / cites work @@
+Q2921696
@@ Property / cites work: Q2921696 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all the perfect matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Perfect matchings in o(             <i>n</i>             log             <i>n</i>             ) time in regular bipartite graphs
+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 @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matchings in general graphs through randomization
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4370201
@@ Property / cites work: Q4370201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474103
@@ Property / cites work: Q4474103 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank