A new parameterized kernelization algorithm for the planar clique cover problem

MaRDI QIDQ2887528zbMATH OpenFDO

Authors Wenyan Zhang, Rudolf Fleischer

Publication date 1 June 2012

Published in Journal of Wuhan University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

kernelizationparameterized algorithmplanar clique cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Data reduction and exact algorithms for clique cover
• Planar graph vertex partition for linear problem kernels
• Data reduction, exact, and heuristic algorithms for clique cover
• Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size

Cited in

(1)

• Graph-Theoretic Concepts in Computer Science

This page was built for publication: A new parameterized kernelization algorithm for the planar clique cover problem

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