Pages that link to "Item:Q3211115"
From MaRDI portal
The following pages link to Maximum matchings in bipartite graphs via strong spanning trees (Q3211115):
Displaying 8 items.
- Signature classes of transportation polytopes (Q689115) (← links)
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- On solving a variation of the assignment problem (Q1390267) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5915825) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)