A new parameterized kernelization algorithm for the planar clique cover problem
From MaRDI portal
Publication:2887528
zbMATH Open1249.68092MaRDI QIDQ2887528FDOQ2887528
Authors: Wenyan Zhang, Rudolf Fleischer 
Publication date: 1 June 2012
Published in: Journal of Wuhan University. Natural Science Edition (Search for Journal in Brave)
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
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)
Cited In (1)
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)
