Pages that link to "Item:Q3059096"
From MaRDI portal
The following pages link to Random procedures for dominating sets in bipartite graphs (Q3059096):
Displaying 5 items.
- Random procedures for dominating sets in graphs (Q986706) (← links)
- Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- (Q4262220) (← links)