An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(87)90193-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2023428944
@@ Property / OpenAlex ID: W2023428944 / 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 @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fast parallel sorting algorithms
@@ Property / cites work: Fast parallel sorting algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Constructing a perfect matching is in random NC
@@ Property / cites work: Constructing a perfect matching is in random NC / rank @@
+Normal rank
@@ Property / cites work @@
+New Parallel-Sorting Schemes
@@ Property / cites work: New Parallel-Sorting Schemes / rank @@
+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