Algorithmic aspect of minus domination on small-degree graphs
DOI10.1007/978-3-319-21398-9_27zbMATH Open1465.68214OpenAlexW2282045788WikidataQ62041726 ScholiaQ62041726MaRDI QIDQ3196397FDOQ3196397
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) 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)
Cites Work
- Optimization, approximation, and complexity classes
- Planar Formulae and Their Uses
- Title not available (Why is that?)
- Minus domination in graphs
- The algorithmic complexity of minus domination in graphs
- Minus domination in small-degree graphs
- On Complexities of Minus Domination
- FPT Results for Signed Domination
Cited In (6)
- The algorithmic complexity of minus domination in graphs
- Algorithms and Complexity of Signed, Minus, and Majority Domination
- Algorithmic aspects of minus total \(k\)-subdomination in graphs
- Title not available (Why is that?)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Title not available (Why is that?)
This page was built for publication: Algorithmic aspect of minus domination on small-degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196397)
