Pages that link to "Item:Q2118390"
From MaRDI portal
The following pages link to Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390):
Displaying 5 items.
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (Q5425488) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)