Pages that link to "Item:Q1946216"
From MaRDI portal
The following pages link to On the approximability and exact algorithms for vector domination and related problems in graphs (Q1946216):
Displaying 18 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Multiple Domination (Q3384609) (← links)
- More on the complexity of defensive domination in graphs (Q6657275) (← links)
