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 Graph Clustering Algorithm Based on Minimum and Normalized Cut
|
---|---|
Chapter number | 66 |
Book title |
Computational Science – ICCS 2007
|
Published by |
Springer, Berlin, Heidelberg, May 2007
|
DOI | 10.1007/978-3-540-72584-8_66 |
Book ISBNs |
978-3-54-072583-1, 978-3-54-072584-8
|
Authors |
Jiabing Wang, Hong Peng, Jingsong Hu, Chuangxin Yang |
Mendeley readers
The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 9% |
Unknown | 10 | 91% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Lecturer | 2 | 18% |
Student > Ph. D. Student | 2 | 18% |
Researcher | 2 | 18% |
Professor | 1 | 9% |
Lecturer > Senior Lecturer | 1 | 9% |
Other | 1 | 9% |
Unknown | 2 | 18% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 55% |
Mathematics | 1 | 9% |
Agricultural and Biological Sciences | 1 | 9% |
Unknown | 3 | 27% |