Complexity and approximation ratio of semitotal domination in graphs
From MaRDI portal
Publication:4583541
Recommendations
- Algorithmic aspects of semitotal domination in graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- The semitotal domination problem in block graphs
- Semitotal domination subdivision numbers of graphs
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- NP-completeness and APX-completeness of restrained domination in graphs
- Optimization, approximation, and complexity classes
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
Cited in
(6)- The semitotal domination problem in block graphs
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- On the semitotal domination number of line graphs
- Algorithmic aspects of semitotal domination in graphs
This page was built for publication: Complexity and approximation ratio of semitotal domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583541)
