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.
Mendeley readers
Chapter title |
A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks
|
---|---|
Chapter number | 116 |
Book title |
Grid and Cooperative Computing
|
Published by |
Springer, Berlin, Heidelberg, December 2003
|
DOI | 10.1007/978-3-540-24680-0_116 |
Book ISBNs |
978-3-54-021993-4, 978-3-54-024680-0
|
Authors |
Xinfang Yan, Yugeng Sun, Yanlin Wang, Yan, Xinfang, Sun, Yugeng, Wang, Yanlin |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 20% |
Unknown | 4 | 80% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 40% |
Researcher | 2 | 40% |
Unknown | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 80% |
Unknown | 1 | 20% |