Pages that link to "Item:Q1334957"
From MaRDI portal
The following pages link to A separation algorithm for the matchable set polytope (Q1334957):
Displaying 4 items.
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Perfectly matchable subgraph problem on a bipartite graph (Q5189879) (← links)