Pages that link to "Item:Q986706"
From MaRDI portal
The following pages link to Random procedures for dominating sets in graphs (Q986706):
Displaying 9 items.
- Dominating sets of random 2-in 2-out directed graphs (Q1010736) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- Sieve methods in random graph theory (Q2701395) (← links)
- Random iteration algorithm for graph-directed sets (Q2917349) (← links)
- Random procedures for dominating sets in bipartite graphs (Q3059096) (← links)
- A note on domination parameters in random graphs (Q3606458) (← links)
- Algorithms and Models for the Web-Graph (Q5311172) (← links)
