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 |
Tight Lower Bounds for the Number of Inclusion-Minimal st -Cuts
|
---|---|
Chapter number | 9 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Cham, June 2018
|
DOI | 10.1007/978-3-030-00256-5_9 |
Book ISBNs |
978-3-03-000255-8, 978-3-03-000256-5
|
Authors |
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari, Conte, Alessio, Grossi, Roberto, Marino, Andrea, Rizzi, Romeo, Uno, Takeaki, Versari, Luca |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Bachelor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |