A simple reduction from maximum weight matching to maximum cardinality matching (Q456169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Decomposition Theorem for Maximum Weight Bipartite Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum skew-symmetric flows and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Price Updates Help / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Algorithms for Matching and Matroid Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for dense graphs and networks on the random access computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in <i>O</i> ( <i>n</i> log log <i>n</i> ) time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between priority queues and sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight bipartite matching in matrix multiplication time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in planar graphs via Gaussian elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs / rank
 
Normal rank

Latest revision as of 19:02, 5 July 2024

scientific article
Language Label Description Also known as
English
A simple reduction from maximum weight matching to maximum cardinality matching
scientific article

    Statements

    A simple reduction from maximum weight matching to maximum cardinality matching (English)
    0 references
    0 references
    23 October 2012
    0 references
    graph algorithms
    0 references
    maximum matching
    0 references
    maximum weight matching
    0 references
    maximum cardinality matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers