Pages that link to "Item:Q5387763"
From MaRDI portal
The following pages link to The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763):
Displaying 8 items.
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Efficiently recognizing graphs with equal independence and annihilation numbers (Q6161447) (← links)
