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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1041; S. 115215
Hauptverfasser:	Liu, Yuxi, Xiao, Mingyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 07.07.2025
Schlagworte:	Graph algorithms Linear kernel Maximum induced matching Parameterized algorithms Parameterized algorithms Graph algorithms Maximum induced matching Linear kernel
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!