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 |
Constructing shortest watchman routes by divide-and-conquer
|
---|---|
Chapter number | 236 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 1993
|
DOI | 10.1007/3-540-57568-5_236 |
Book ISBNs |
978-3-54-057568-9, 978-3-54-048233-8
|
Authors |
Xuehou Tan, Tomio Hirata, Tan, Xuehou, Hirata, Tomio |
Mendeley readers
The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 9 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 33% |
Researcher | 3 | 33% |
Student > Doctoral Student | 1 | 11% |
Student > Master | 1 | 11% |
Unknown | 1 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 78% |
Physics and Astronomy | 1 | 11% |
Unknown | 1 | 11% |