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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 123; S. 76 - 102
Hauptverfasser:	Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.02.2022
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!