Kernelization and Lower Bounds of the Signed Domination Problem
From MaRDI portal
Publication:5405938
DOI10.1007/978-3-642-38756-2_27zbMath1303.05148MaRDI QIDQ5405938
Ying Zheng, Qilong Feng, Jianxin Wang
Publication date: 3 April 2014
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_27
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)