Pages that link to "Item:Q1178733"
From MaRDI portal
The following pages link to The uniquely solvable bipartite matching problem (Q1178733):
Displaying 6 items.
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Persistency in maximum cardinality bipartite matchings (Q1332944) (← links)
- Trapezoidal matrices and the bottleneck assignment problem (Q1805450) (← links)
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
