Pages that link to "Item:Q2165581"
From MaRDI portal
The following pages link to Revisiting a cutting-plane method for perfect matchings (Q2165581):
Displaying 4 items.
- Minimum-error classes for matching parts (Q2661599) (← links)
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming (Q2696937) (← links)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)