Algorithms and Hardness for Signed Domination

DOI10.1007/978-3-319-17142-5_38zbMath1459.68161OpenAlexW2293380391WikidataQ62041729 ScholiaQ62041729MaRDI QIDQ2948490

Jin-Yong Lin, Sheung-Hung Poon

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) 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) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Algorithms and Complexity of Signed, Minus, and Majority Domination

Cites Work

• Unnamed Item
• On Complexities of Minus Domination
• Kernelization and Lower Bounds of the Signed Domination Problem
• Minus domination in small-degree graphs

This page was built for publication: Algorithms and Hardness for Signed Domination