Pages that link to "Item:Q1790990"
From MaRDI portal
The following pages link to An FPT algorithm for contraction to cactus (Q1790990):
Displaying 6 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)