Pages that link to "Item:Q832521"
From MaRDI portal
The following pages link to On the parameterized complexity of maximum degree contraction problem (Q832521):
Displaying 4 items.
- A general framework for computing maximal contractions (Q2418637) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
