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 |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
|
---|---|
Chapter number | 26 |
Book title |
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
|
Published by |
Springer, Berlin, Heidelberg, December 2007
|
DOI | 10.1007/978-3-540-77050-3_26 |
Book ISBNs |
978-3-54-077049-7, 978-3-54-077050-3
|
Authors |
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh, Alon, Noga, Fomin, Fedor V., Gutin, Gregory, Krivelevich, Michael, Saurabh, Saket |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Brazil | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Lecturer | 1 | 25% |
Student > Master | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 25% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |
Unknown | 1 | 25% |