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 |
Counting Minimum ( s , t )-Cuts in Weighted Planar Graphs in Polynomial Time
|
---|---|
Chapter number | 13 |
Book title |
Mathematical Foundations of Computer Science 2010
|
Published in |
ADS, August 2010
|
DOI | 10.1007/978-3-642-15155-2_13 |
Book ISBNs |
978-3-64-215154-5, 978-3-64-215155-2
|
Authors |
Ivona Bezáková, Adam J. Friedlander, Bezáková, Ivona, Friedlander, Adam J. |
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 % |
---|---|---|
Professor > Associate Professor | 1 | 33% |
Researcher | 1 | 33% |
Lecturer | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 33% |
Computer Science | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |