Pages that link to "Item:Q1157169"
From MaRDI portal
The following pages link to Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169):
Displaying 5 items.
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Some independence results in complexity theory<sup>†</sup> (Q3751002) (← links)
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)
- Towards optimal running timesfor optimal transport (Q6556151) (← links)