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 |
Sub-cubic cost algorithms for the all pairs shortest path problem
|
---|---|
Chapter number | 86 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1995
|
DOI | 10.1007/3-540-60618-1_86 |
Book ISBNs |
978-3-54-060618-5, 978-3-54-048487-5
|
Authors |
Tadao Takaoka, Takaoka, Tadao |
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 % |
---|---|---|
Spain | 1 | 20% |
India | 1 | 20% |
Canada | 1 | 20% |
Unknown | 2 | 40% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 40% |
Professor > Associate Professor | 1 | 20% |
Student > Bachelor | 1 | 20% |
Student > Doctoral Student | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 80% |
Environmental Science | 1 | 20% |