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 |
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
|
---|---|
Chapter number | 46 |
Book title |
LATIN 2006: Theoretical Informatics
|
Published by |
Springer, Berlin, Heidelberg, March 2006
|
DOI | 10.1007/11682462_46 |
Book ISBNs |
978-3-54-032755-4, 978-3-54-032756-1
|
Authors |
Martin Fürer, Fürer, Martin |
Mendeley readers
The data shown below were compiled from readership statistics for 24 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 4% |
Unknown | 23 | 96% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 29% |
Student > Master | 4 | 17% |
Researcher | 3 | 13% |
Professor | 2 | 8% |
Lecturer | 2 | 8% |
Other | 4 | 17% |
Unknown | 2 | 8% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 19 | 79% |
Mathematics | 1 | 4% |
Agricultural and Biological Sciences | 1 | 4% |
Physics and Astronomy | 1 | 4% |
Unknown | 2 | 8% |