Pages that link to "Item:Q3502661"
From MaRDI portal
The following pages link to Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661):
Displaying 10 items.
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- Smallest maximal matchings of graphs (Q6100387) (← links)
- Minimal zero forcing sets (Q6644905) (← links)