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 |
Greedy Approximation Algorithms for Finding Dense Components in a Graph
|
---|---|
Chapter number | 10 |
Book title |
Approximation Algorithms for Combinatorial Optimization
|
Published by |
Springer, Berlin, Heidelberg, September 2000
|
DOI | 10.1007/3-540-44436-x_10 |
Book ISBNs |
978-3-54-067996-7, 978-3-54-044436-7
|
Authors |
Moses Charikar, Charikar, Moses |
Mendeley readers
The data shown below were compiled from readership statistics for 118 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 3 | 3% |
France | 2 | 2% |
Hong Kong | 1 | <1% |
Germany | 1 | <1% |
Russia | 1 | <1% |
Estonia | 1 | <1% |
Unknown | 109 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 39 | 33% |
Researcher | 22 | 19% |
Student > Master | 15 | 13% |
Professor > Associate Professor | 8 | 7% |
Student > Doctoral Student | 7 | 6% |
Other | 14 | 12% |
Unknown | 13 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 83 | 70% |
Agricultural and Biological Sciences | 5 | 4% |
Mathematics | 4 | 3% |
Engineering | 4 | 3% |
Biochemistry, Genetics and Molecular Biology | 2 | 2% |
Other | 6 | 5% |
Unknown | 14 | 12% |