Pages that link to "Item:Q5894186"
From MaRDI portal
The following pages link to Approximating Maximum Subgraphs without Short Cycles (Q5894186):
Displaying 4 items.
- Kernelization for cycle transversal problems (Q423937) (← links)
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
