Pages that link to "Item:Q5704842"
From MaRDI portal
The following pages link to Randomized greedy algorithms for finding smallk-dominating sets of regular graphs (Q5704842):
Displaying 11 items.
- The expected size of the Rule \(k\) dominating set (Q866955) (← links)
- Random procedures for dominating sets in graphs (Q986706) (← links)
- Dominating sets of random 2-in 2-out directed graphs (Q1010736) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
- Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
- Total domination in regular graphs (Q2132388) (← links)
- Asymptotic bounds on total domination in regular graphs (Q2659200) (← links)
- Small edge dominating sets of regular graphs (Q2845517) (← links)