Minimum Connected Dominating Sets of Random Cubic Graphs
Copyright policy )Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm, is analysed on random $n$-vertex cubic graphs using differential equations. In this way, we prove that the expected size of the connected dominating set returned by the algorithm is asymptotically almost surely less than $0.5854n$.
- Macquarie University Australia
- University of Melbourne Australia
connected dominating set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Random graphs (graph-theoretic aspects), cubic graphs, random graph
connected dominating set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Random graphs (graph-theoretic aspects), cubic graphs, random graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!