Maximum weight bipartite matching in matrix multiplication time (Q1035683): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.07.028
+Normal rank
@@ Property / OpenAlex ID @@
+W1999848117
@@ Property / OpenAlex ID: W1999848117 / rank @@
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615775
@@ Property / cites work: Q5615775 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Scaling algorithms for network problems
@@ Property / cites work: Scaling algorithms for network problems / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Scaling Algorithms for Network Problems
@@ Property / cites work: Faster Scaling Algorithms for Network Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scaling Algorithms for the Shortest Paths Problem
@@ Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Decomposition Theorem for Maximum Weight Bipartite Matchings
+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 @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3891767
@@ Property / cites work: Q3891767 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Maximum matchings in general graphs through randomization
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+High-order lifting and integrality certification
@@ Property / cites work: High-order lifting and integrality certification / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1035683