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 |
Lower Bounds for Graph Exploration Using Local Policies
|
---|---|
Chapter number | 5 |
Book title |
WALCOM: Algorithms and Computation
|
Published by |
Springer International Publishing, January 2016
|
DOI | 10.1007/978-3-319-30139-6_5 |
Book ISBNs |
978-3-31-930138-9, 978-3-31-930139-6
|
Authors |
Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin, Akash, Aditya Kumar, Fekete, Sándor P., Lee, Seoung Kyou, López-Ortiz, Alejandro, Maftuleac, Daniela, McLurkin, James |
Editors |
Mohammad Kaykobad, Rossella Petreschi |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 33% |
Unknown | 2 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 33% |
Researcher | 1 | 33% |
Student > Master | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Engineering | 1 | 33% |