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 |
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
|
---|---|
Chapter number | 13 |
Book title |
Algorithms and Models for the Web Graph
|
Published by |
Springer, Cham, December 2013
|
DOI | 10.1007/978-3-319-03536-9_13 |
Book ISBNs |
978-3-31-903535-2, 978-3-31-903536-9
|
Authors |
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao, Alok Choudhary |
Mendeley readers
The data shown below were compiled from readership statistics for 58 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 3 | 5% |
Poland | 1 | 2% |
Unknown | 54 | 93% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 17 | 29% |
Researcher | 11 | 19% |
Student > Ph. D. Student | 11 | 19% |
Lecturer | 3 | 5% |
Student > Bachelor | 3 | 5% |
Other | 5 | 9% |
Unknown | 8 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 29 | 50% |
Engineering | 7 | 12% |
Mathematics | 6 | 10% |
Agricultural and Biological Sciences | 4 | 7% |
Sports and Recreations | 1 | 2% |
Other | 2 | 3% |
Unknown | 9 | 16% |