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 |
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs
|
---|---|
Chapter number | 19 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Cham, February 2014
|
DOI | 10.1007/978-3-319-04657-0_19 |
Book ISBNs |
978-3-31-904656-3, 978-3-31-904657-0
|
Authors |
Alka Bhushan, G. Sajith |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 2 | 67% |
Researcher | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Business, Management and Accounting | 1 | 33% |