Pages that link to "Item:Q2446590"
From MaRDI portal
The following pages link to Towards optimal kernel for edge-disjoint triangle packing (Q2446590):
Displaying 11 items.
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- A 42k Kernel for the Complementary Maximal Strip Recovery Problem (Q4632213) (← links)
- Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
- A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)
