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 |
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
|
---|---|
Chapter number | 2 |
Book title |
Algorithms and Complexity
|
Published by |
Springer, Berlin, Heidelberg, March 2000
|
DOI | 10.1007/3-540-46521-9_2 |
Book ISBNs |
978-3-54-067159-6, 978-3-54-046521-8
|
Authors |
Narsingh Deo, Ayman Abdalla |
Mendeley readers
The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 8% |
Austria | 1 | 8% |
Unknown | 10 | 83% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 3 | 25% |
Professor > Associate Professor | 2 | 17% |
Student > Ph. D. Student | 2 | 17% |
Librarian | 1 | 8% |
Lecturer | 1 | 8% |
Other | 2 | 17% |
Unknown | 1 | 8% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 33% |
Business, Management and Accounting | 3 | 25% |
Mathematics | 1 | 8% |
Agricultural and Biological Sciences | 1 | 8% |
Social Sciences | 1 | 8% |
Other | 0 | 0% |
Unknown | 2 | 17% |