Parameterized algorithms and kernels for almost induced matching.
THEORETICAL COMPUTER SCIENCE(2020)
摘要
The ALMOST INDUCED MATCHING problem asks whether we can delete at most k vertices from the input graph such that each vertex in the remaining graph has a degree exactly one. This paper studies parameterized algorithms for this problem by taking the size k of the deletion set as the parameter. We give a 7k-vertex kernel and an 0*(1.74851`)-time and polynomial-space algorithm, both of which are the best-known results. The linearvertex kernel is obtained by using an extended crown decomposition and careful analysis, and the parameterized algorithm is based on a branch-and-search paradigm. (C) 2020 Elsevier B.V. All rights reserved.
更多查看译文
关键词
Maximum induced matching,Linear kernel,Parameterized algorithms,Graph algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络