Co-Nondeterminism in Compositions

DOI10.1145/2635808zbMath1398.68249OpenAlexW2133839241MaRDI QIDQ4962153

Stefan Kratsch

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2635808

zbMATH Keywords

Ramsey numbersnondeterminismparameterized complexitykernelization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Generalized Ramsey theory (05C55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Hans Bodlaender and the Theory of Kernelization Lower Bounds ⋮ Essentially tight kernels for (weakly) closed graphs ⋮ FPT is characterized by useful obstruction sets ⋮ Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms

This page was built for publication: Co-Nondeterminism in Compositions