Algorithms - ESA 2014
Springer Berlin Heidelberg
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 |
Fault-Tolerant Approximate Shortest-Path Trees
|
|---|---|
| Chapter number | 12 |
| Book title |
Algorithms - ESA 2014
|
| Published by |
Springer, Berlin, Heidelberg, September 2014
|
| DOI | 10.1007/978-3-662-44777-2_12 |
| Book ISBNs |
978-3-66-244776-5, 978-3-66-244777-2
|
| Authors |
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Proietti, Guido |
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 % |
|---|---|---|
| United States | 1 | 25% |
| Unknown | 3 | 75% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Researcher | 2 | 50% |
| Student > Ph. D. Student | 1 | 25% |
| Student > Master | 1 | 25% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 3 | 75% |
| Engineering | 1 | 25% |