Pages that link to "Item:Q1035683"

The following pages link to Maximum weight bipartite matching in matrix multiplication time (Q1035683):

Displaying 13 items.

• Fair matchings and related problems (Q270032) (← links)
• A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
• A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
• Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
• Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
• Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• (Q4638113) (← links)
• (Q5002673) (← links)
• (Q5743485) (← links)
• Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644) (← links)
• Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)