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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1041; s. 115215
Hlavní autori:	Liu, Yuxi, Xiao, Mingyu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 07.07.2025
Predmet:	Graph algorithms Linear kernel Maximum induced matching Parameterized algorithms Parameterized algorithms Graph algorithms Maximum induced matching Linear kernel
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!