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 |
Enumerating Spanning and Connected Subsets in Graphs and Matroids
|
---|---|
Chapter number | 41 |
Book title |
Algorithms – ESA 2006
|
Published by |
Springer Berlin Heidelberg, January 2006
|
DOI | 10.1007/11841036_41 |
Book ISBNs |
978-3-54-038875-3, 978-3-54-038876-0
|
Authors |
L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino |
Editors |
Yossi Azar, Thomas Erlebach |
Mendeley readers
The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 8% |
Unknown | 11 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 3 | 25% |
Professor > Associate Professor | 1 | 8% |
Lecturer | 1 | 8% |
Student > Master | 1 | 8% |
Unknown | 6 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 17% |
Computer Science | 1 | 8% |
Agricultural and Biological Sciences | 1 | 8% |
Medicine and Dentistry | 1 | 8% |
Unknown | 7 | 58% |