Pages that link to "Item:Q557830"
From MaRDI portal
The following pages link to On approximating minimum vertex cover for graphs with perfect matching (Q557830):
Displaying 4 items.
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
