Space-efficient graph kernelizations

DOI10.1007/978-981-97-2340-9_22MaRDI QIDQ6636090

Frank Kammer, Andrej Sajenko

Publication date: 12 November 2024

zbMATH Keywords

feedback vertex setspace-efficient algorithmpath contractionfull kernel

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved kernel results for some FPT problems based on simple observations
• Advice classes of parametrized tractability
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• Multistage graph problems on a global budget
• Improved algorithms for feedback vertex set problems
• On the space and circuit complexity of parameterized problems: classes and completeness
• A 4 k ² kernel for feedback vertex set
• A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
• Problems complete for deterministic logarithmic space
• Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs
• Optimal In-place Algorithms for Basic Graph Problems
• Parameterized Algorithms

This page was built for publication: Space-efficient graph kernelizations