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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999848117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theorem for Maximum Weight Bipartite Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in general graphs through randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order lifting and integrality certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 02:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Maximum weight bipartite matching in matrix multiplication time
scientific article

    Statements

    Maximum weight bipartite matching in matrix multiplication time (English)
    0 references
    0 references
    4 November 2009
    0 references
    matchings in graphs
    0 references
    matrix multiplication
    0 references
    weighted perfect matchings
    0 references
    shortest paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references