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 12 items.
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← 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)
- (Q5377028) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)