Pages that link to "Item:Q1941386"
From MaRDI portal
The following pages link to Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386):
Displaying 9 items.
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- A note on \(\alpha\)-total domination in cubic graphs (Q516909) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Multiple domination models for placement of electric vehicle charging stations in road networks (Q1652655) (← links)
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- The probabilistic approach to limited packings in graphs (Q2341760) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
- Random procedures for dominating sets in bipartite graphs (Q3059096) (← links)
