Kernelization and Lower Bounds of the Signed Domination Problem

DOI10.1007/978-3-642-38756-2_27zbMath1303.05148OpenAlexW58733852MaRDI QIDQ5405938

Qilong Feng, Ying Zheng, 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Algorithms and Hardness for Signed Domination ⋮ On complexities of minus domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ On Complexities of Minus Domination

This page was built for publication: Kernelization and Lower Bounds of the Signed Domination Problem