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 |
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
|
---|---|
Chapter number | 34 |
Book title |
Experimental and Efficient Algorithms
|
Published by |
Springer, Berlin, Heidelberg, May 2004
|
DOI | 10.1007/978-3-540-24838-5_34 |
Book ISBNs |
978-3-54-022067-1, 978-3-54-024838-5
|
Authors |
Andréa C. dos Santos, Abílio Lucena, Celso C. Ribeiro, dos Santos, Andréa C., Lucena, Abílio, Ribeiro, Celso C. |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 10% |
Austria | 1 | 10% |
Unknown | 8 | 80% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 30% |
Professor | 2 | 20% |
Researcher | 2 | 20% |
Student > Master | 2 | 20% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 70% |
Business, Management and Accounting | 2 | 20% |
Unknown | 1 | 10% |