Pages that link to "Item:Q730497"
From MaRDI portal
The following pages link to Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497):
Displaying 12 items.
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- (Q2921444) (redirect page) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)