Pages that link to "Item:Q456136"
From MaRDI portal
The following pages link to Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136):
Displayed 3 items.
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)