Pages that link to "Item:Q2857031"
From MaRDI portal
The following pages link to Maximum semi-matching problem in bipartite graphs (Q2857031):
Displaying 11 items.
- Distributed backup placement in networks (Q1741963) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)
- Faster algorithms for semi-matching problems (Q2799478) (← links)
- Maximum matchings in bipartite graphs via strong spanning trees (Q3211115) (← links)
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5918112) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)