Refined notions of parameterized enumeration kernels with applications to matching cut enumeration

An enumeration kernel as defined by Creignou et al. (2017) [11] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a solution-lifting algorithm that efficiently enumerates all solutions from the set of t...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 123; s. 76 - 102
Hlavní autori:	Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2022
Predmet:	Enumeration problems Kernelization Matching cuts Output-sensitive algorithms Polynomial delay Structural parameterizations Enumeration problems Output-sensitive algorithms Polynomial delay Structural parameterizations Kernelization Matching cuts
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!