Pages that link to "Item:Q2675722"
From MaRDI portal
The following pages link to On the computational complexity of the bipartizing matching problem (Q2675722):
Displaying 5 items.
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- (Q5743414) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)