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 |
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
|
---|---|
Chapter number | 30 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2009
|
DOI | 10.1007/978-3-642-10631-6_30 |
Book ISBNs |
978-3-64-210630-9, 978-3-64-210631-6
|
Authors |
Dae Young Seo, D. T. Lee, Tien-Ching Lin, Seo, Dae Young, Lee, D. T., Lin, Tien-Ching |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 33% |
Professor > Associate Professor | 2 | 33% |
Researcher | 1 | 17% |
Lecturer | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 50% |
Mathematics | 1 | 17% |
Agricultural and Biological Sciences | 1 | 17% |
Engineering | 1 | 17% |