An improved kernel and parameterized algorithm for deletion to induced matching

A graph is called an induced matching if each vertex in the graph is a degree-1 vertex. The Deletion to Induced Matching problem asks whether we can delete at most k vertices from the input graph such that the remaining graph is an induced matching. This paper studies parameterized algorithms for th...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1041; p. 115215
Main Authors:	Liu, Yuxi, Xiao, Mingyu
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 07.07.2025
Subjects:	Graph algorithms Linear kernel Maximum induced matching Parameterized algorithms Parameterized algorithms Graph algorithms Maximum induced matching Linear kernel
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!