Finding maximum matching for bipartite graphs in parallel (Q1342094): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(94)90021-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2036940309
@@ Property / OpenAlex ID: W2036940309 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Fast parallel graph searching with applications
@@ Property / cites work: Fast parallel graph searching with applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023518
@@ Property / cites work: Q4023518 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
+Normal rank
@@ Property / cites work @@
+Parallel computation and conflicts in memory access
+Normal rank
@@ Property / cites work @@
+An O(n2log n) parallel max-flow algorithm
@@ Property / cites work: An O(n2log n) parallel max-flow algorithm / rank @@
+Normal rank