Pages that link to "Item:Q2023124"
From MaRDI portal
The following pages link to Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124):
Displaying 13 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- On maximum induced matchings in bipartite graphs (Q1847371) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)
- A decomposition theorem for maximum weight bipartite matchings (Q2719128) (← links)
- An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs (Q5089613) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)