Algorithms and Hardness for Signed Domination
DOI10.1007/978-3-319-17142-5_38zbMATH Open1459.68161OpenAlexW2293380391WikidataQ62041729 ScholiaQ62041729MaRDI QIDQ2948490FDOQ2948490
Authors: 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
Recommendations
- scientific article; zbMATH DE number 825134
- Algorithms and complexity of signed, minus, and majority domination
- On the complexity of signed and minus total domination in graphs
- Some NP-complete results on signed mixed domination problem
- On the signed domination in graphs
- Kernelization and Lower Bounds of the Signed Domination Problem
- On domination in signed graphs
- scientific article; zbMATH DE number 2080250
- Efficient minus and signed domination in graphs
- scientific article; zbMATH DE number 861417
Graph algorithms (graph-theoretic aspects) (05C85) 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) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
Cited In (4)
This page was built for publication: Algorithms and Hardness for Signed Domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948490)
