Pages that link to "Item:Q2000005"
From MaRDI portal
The following pages link to On the parameterized complexity of contraction to generalization of trees (Q2000005):
Displaying 8 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
