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 |
Finding Dense Subgraphs with Size Bounds
|
|---|---|
| Chapter number | 3 |
| Book title |
Algorithms and Models for the Web-Graph
|
| Published by |
Springer, Berlin, Heidelberg, February 2009
|
| DOI | 10.1007/978-3-540-95995-3_3 |
| Book ISBNs |
978-3-54-095994-6, 978-3-54-095995-3
|
| Authors |
Reid Andersen, Kumar Chellapilla, Andersen, Reid, Chellapilla, Kumar |
Mendeley readers
The data shown below were compiled from readership statistics for 39 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United States | 1 | 3% |
| Belgium | 1 | 3% |
| Unknown | 37 | 95% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 10 | 26% |
| Student > Master | 7 | 18% |
| Professor > Associate Professor | 6 | 15% |
| Researcher | 5 | 13% |
| Professor | 4 | 10% |
| Other | 4 | 10% |
| Unknown | 3 | 8% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 22 | 56% |
| Mathematics | 4 | 10% |
| Business, Management and Accounting | 3 | 8% |
| Agricultural and Biological Sciences | 1 | 3% |
| Psychology | 1 | 3% |
| Other | 2 | 5% |
| Unknown | 6 | 15% |