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 |
An Approximation Algorithm for Maximum Internal Spanning Tree
|
---|---|
Chapter number | 30 |
Book title |
WALCOM: Algorithms and Computation
|
Published by |
Springer, Cham, March 2017
|
DOI | 10.1007/978-3-319-53925-6_30 |
Book ISBNs |
978-3-31-953924-9, 978-3-31-953925-6
|
Authors |
Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang, Chen, Zhi-Zhong, Harada, Youta, Guo, Fei, Wang, Lusheng |
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 > Ph. D. Student | 1 | 25% |
Unknown | 3 | 75% |
Readers by discipline | Count | As % |
---|---|---|
Engineering | 1 | 25% |
Unknown | 3 | 75% |