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 Parallel Algorithm for Computing Shortest Paths In Large-Scale Networks
|
---|---|
Chapter number | 151 |
Book title |
Computational Science – ICCS 2005
|
Published by |
Springer, Berlin, Heidelberg, May 2005
|
DOI | 10.1007/11428862_151 |
Book ISBNs |
978-3-54-026044-8, 978-3-54-032118-7
|
Authors |
Guozhen Tan, Xiaohui Ping, Tan, Guozhen, Ping, Xiaohui |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Doctoral Student | 2 | 50% |
Student > Master | 1 | 25% |
Unknown | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 50% |
Engineering | 1 | 25% |
Unknown | 1 | 25% |