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 |
Maximal Flow Through a Network
|
|---|---|
| Chapter number | 15 |
| Book title |
Classic Papers in Combinatorics
|
| Published by |
Birkhäuser Boston, January 1987
|
| DOI | 10.1007/978-0-8176-4842-8_15 |
| Book ISBNs |
978-0-8176-4841-1, 978-0-8176-4842-8
|
| Authors |
L. R. Ford Jr., D. R. Fulkerson, L. R. FordJr., L. R. Ford |
| Editors |
Ira Gessel, Gian-Carlo Rota |
Mendeley readers
The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Israel | 1 | 6% |
| Unknown | 16 | 94% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 7 | 41% |
| Student > Bachelor | 3 | 18% |
| Student > Master | 2 | 12% |
| Researcher | 2 | 12% |
| Student > Postgraduate | 2 | 12% |
| Other | 0 | 0% |
| Unknown | 1 | 6% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 9 | 53% |
| Engineering | 4 | 24% |
| Agricultural and Biological Sciences | 1 | 6% |
| Physics and Astronomy | 1 | 6% |
| Economics, Econometrics and Finance | 1 | 6% |
| Other | 0 | 0% |
| Unknown | 1 | 6% |