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 |
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
|
---|---|
Chapter number | 12 |
Book title |
SOFSEM 2011: Theory and Practice of Computer Science
|
Published in |
ADS, January 2011
|
DOI | 10.1007/978-3-642-18381-2_12 |
Book ISBNs |
978-3-64-218380-5, 978-3-64-218381-2
|
Authors |
Piotr Borowiecki, Frank Göring, Borowiecki, Piotr, Göring, Frank |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 20% |
Unknown | 4 | 80% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 2 | 40% |
Professor > Associate Professor | 1 | 20% |
Lecturer | 1 | 20% |
Other | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Agricultural and Biological Sciences | 2 | 40% |
Computer Science | 2 | 40% |
Mathematics | 1 | 20% |