Pages that link to "Item:Q4277507"
From MaRDI portal
The following pages link to Reducing Matching to Polynomial Size Linear Programming (Q4277507):
Displaying 6 items.
- On cuts and matchings in planar graphs (Q688915) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
