Publication:5111869

DOI10.4230/LIPIcs.IPEC.2017.10zbMath1443.68071MaRDI QIDQ5111869

Marin Bougeret, Ignasi Sau

Publication date: 27 May 2020

zbMATH Keywords

treewidth; parameterized complexity; sparse graphs; structural parameters; polynomial kernels; treedepth

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization