Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints

DOI10.1007/978-3-662-48350-3_46zbMath1432.68193arXiv1411.6756MaRDI QIDQ3452817

Ariel Gabizon, Michał Pilipczuk, Daniel Lokshtanov

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6756

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization