Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.parco.2011.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2089353209
@@ Property / OpenAlex ID: W2089353209 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3324796
@@ Property / cites work: Q3324796 / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+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 @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Power balance and apportionment algorithms for the United States Congress
+Normal rank
@@ Property / cites work @@
+A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
+Normal rank
@@ Property / cites work @@
+Heuristic initialization for bipartite matching problems
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and applications.
+Normal rank
@@ Property / cites work @@
+Q4827372
@@ Property / cites work: Q4827372 / rank @@
+Normal rank
@@ Property / cites work @@
+Power balance and apportionment algorithms for the United States Congress
+Normal rank
@@ Property / cites work @@
+Clique partitions, graph compression and speeding-up algorithms
+Normal rank