Pages that link to "Item:Q2901005"
From MaRDI portal
The following pages link to Matchings in node-weighted convex bipartite graphs (Q2901005):
Displaying 10 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs (Q2872116) (← links)
- Fast Dynamic Weight Matchings in Convex Bipartite Graphs (Q2946428) (← links)
- Dynamic Matchings in Left Weighted Convex Bipartite Graphs (Q3188860) (← links)
- An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs (Q5089613) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)