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 Simple Linear Time Algorithm for Computing a (2k — 1)-Spanner of O(n
1+1/k
) Size in Weighted Graphs
|
---|---|
Chapter number | 32 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, June 2003
|
DOI | 10.1007/3-540-45061-0_32 |
Book ISBNs |
978-3-54-040493-4, 978-3-54-045061-0
|
Authors |
Surender Baswana, Sandeep Sen |
Editors |
Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger |
Mendeley readers
The data shown below were compiled from readership statistics for 25 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 4% |
Unknown | 24 | 96% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 7 | 28% |
Student > Ph. D. Student | 5 | 20% |
Professor > Associate Professor | 3 | 12% |
Lecturer | 2 | 8% |
Researcher | 2 | 8% |
Other | 2 | 8% |
Unknown | 4 | 16% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 16 | 64% |
Mathematics | 2 | 8% |
Unspecified | 1 | 4% |
Agricultural and Biological Sciences | 1 | 4% |
Physics and Astronomy | 1 | 4% |
Other | 0 | 0% |
Unknown | 4 | 16% |