Maximum weight bipartite matching in matrix multiplication time
- 1 October 2009
- journal article
- conference paper
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (44) , 4480-4488
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Maximum Matchings via Gaussian Elimination2004
- A Decomposition Theorem for Maximum Weight Bipartite MatchingsSIAM Journal on Computing, 2001
- Scaling Algorithms for the Shortest Paths ProblemSIAM Journal on Computing, 1995
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- On a routing problemQuarterly of Applied Mathematics, 1958
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955