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
| Title |
Finding maximal k-edge-connected subgraphs from a large graph
|
|---|---|
| Published by |
Association for Computing Machinery (ACM), March 2012
|
| DOI | 10.1145/2247596.2247652 |
| Authors |
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li |
Mendeley readers
The data shown below were compiled from readership statistics for 28 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 28 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 6 | 21% |
| Student > Bachelor | 4 | 14% |
| Student > Master | 4 | 14% |
| Student > Doctoral Student | 3 | 11% |
| Researcher | 2 | 7% |
| Other | 6 | 21% |
| Unknown | 3 | 11% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 19 | 68% |
| Engineering | 2 | 7% |
| Social Sciences | 1 | 4% |
| Mathematics | 1 | 4% |
| Unknown | 5 | 18% |