Pages that link to "Item:Q3404454"
From MaRDI portal
The following pages link to FPT Algorithms for Connected Feedback Vertex Set (Q3404454):
Displaying 7 items.
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Connecting face hitting sets in planar graphs (Q1944026) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- (Q5005155) (← links)
- (Q5090497) (← links)
