Pages that link to "Item:Q4636570"
From MaRDI portal
The following pages link to Lossy Kernels for Graph Contraction Problems (Q4636570):
Displaying 12 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- (Q3304124) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- (Q5089236) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
