Algorithmic Aspect of Minus Domination on Small-Degree Graphs

DOI10.1007/978-3-319-21398-9_27zbMath1465.68214OpenAlexW2282045788WikidataQ62041726 ScholiaQ62041726MaRDI QIDQ3196397

Jin-Yong Lin, Sheung-Hung Poon, Ching-Hao Liu

Publication date: 29 October 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-21398-9_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) 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)

Related Items

Algorithms and Complexity of Signed, Minus, and Majority Domination

Cites Work

• Unnamed Item
• Optimization, approximation, and complexity classes
• Minus domination in graphs
• The algorithmic complexity of minus domination in graphs
• On Complexities of Minus Domination
• FPT Results for Signed Domination
• Planar Formulae and Their Uses
• Minus domination in small-degree graphs