Pages that link to "Item:Q4583541"
From MaRDI portal
The following pages link to Complexity and approximation ratio of semitotal domination in graphs (Q4583541):
Displaying 4 items.
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- The semitotal domination problem in block graphs (Q2062683) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
