Pages that link to "Item:Q3652213"
From MaRDI portal
The following pages link to A Linear Vertex Kernel for Maximum Internal Spanning Tree (Q3652213):
Displaying 6 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves (Q6546606) (← links)
