You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs
Algorithms and Complexity
Springer, Berlin, Heidelberg, May 2003
William Duckworth, Bernard Mans
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||2||67%|
|Readers by discipline||Count||As %|