When is red-blue nonblocker fixed-parameter tractable?
From MaRDI portal
Publication:2294711
DOI10.1007/978-3-319-77404-6_38zbMath1485.68183OpenAlexW2790708743MaRDI QIDQ2294711
Stefan Rümmele, Serge Gaspers, Michael Horton, Joachim Gudmundsson
Publication date: 12 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_38
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: When is red-blue nonblocker fixed-parameter tractable?