The Expected Size of the Rule k Dominating Set
Hansen, Jennie C. · Schmutz, Eric
Original · EN
Rule k is a localized approximation algorithm that finds a small connected dominating set in a graph. We estimate the expected size of the Rule k dominating set for the model of random unit disk graphs constructed from n random points in an sₙ by sₙ square region of the plane.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.