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
Title |
Solving the k-dominating set problem on very large-scale networks
|
---|---|
Published in |
Computational Social Networks, July 2020
|
DOI | 10.1186/s40649-020-00078-5 |
Authors |
Minh Hai Nguyen, Minh Hoàng Hà, Diep N. Nguyen, The Trung Tran |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Lecturer | 2 | 20% |
Student > Ph. D. Student | 1 | 10% |
Unspecified | 1 | 10% |
Student > Bachelor | 1 | 10% |
Other | 1 | 10% |
Other | 0 | 0% |
Unknown | 4 | 40% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 40% |
Mathematics | 1 | 10% |
Unspecified | 1 | 10% |
Unknown | 4 | 40% |