Parameterized algorithm for 3-path vertex cover

DOI10.1016/j.tcs.2019.03.013zbMath1423.68358arXiv1809.02636MaRDI QIDQ2317858

Dekel Tsur

Publication date: 13 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithms; parameterized complexity; 3-path vertex cover

Mathematics Subject Classification ID

68W40: Analysis of algorithms

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

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

05C85: Graph algorithms (graph-theoretic aspects)