Parameterizing edge modification problems above lower bounds

DOI10.1007/S00224-016-9746-5MaRDI QIDQ6827445zbMATH OpenFDO

Authors René van Bevern, Vincent Froese, Christian Komusiewicz

Publication date 1 June 2018

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-016-9746-5

zbMATH Keywords

cluster editingfeedback arc setfixed-parameter algorithmgraph-based clusteringkernelizationNP-hard problemsubgraph packing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• Graph clustering problems under the Lens of parameterized local search
• Cluster editing parameterized above modification-disjoint P₃-packings
• Cluster editing parameterized above modification-disjoint P₃-Packings
• Graph clustering problems under the Lens of parameterized local search

This page was built for publication: Parameterizing edge modification problems above lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827445)