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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 123; pp. 76 - 102
Main Authors:	Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!