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 |
Using sparsification for parametric minimum spanning tree problems
|
---|---|
Chapter number | 128 |
Book title |
Algorithm Theory — SWAT'96
|
Published by |
Springer, Berlin, Heidelberg, July 1996
|
DOI | 10.1007/3-540-61422-2_128 |
Book ISBNs |
978-3-54-061422-7, 978-3-54-068529-6
|
Authors |
David Fernández-Baca, Giora Slutzki, David Eppstein, Fernández-Baca, David, Slutzki, Giora, Eppstein, David |
Mendeley readers
The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 13% |
Unknown | 7 | 88% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 50% |
Student > Doctoral Student | 1 | 13% |
Other | 1 | 13% |
Professor | 1 | 13% |
Student > Master | 1 | 13% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 75% |
Environmental Science | 1 | 13% |
Unknown | 1 | 13% |