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 |
Min-Cuts and Shortest Cycles in Planar Graphs in O ( n loglog n ) Time
|
---|---|
Chapter number | 14 |
Book title |
Algorithms – ESA 2011
|
Published by |
Springer, Berlin, Heidelberg, September 2011
|
DOI | 10.1007/978-3-642-23719-5_14 |
Book ISBNs |
978-3-64-223718-8, 978-3-64-223719-5
|
Authors |
Jakub Łącki, Piotr Sankowski, Łącki, Jakub, Sankowski, Piotr |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 10% |
Russia | 1 | 10% |
Unknown | 8 | 80% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 4 | 40% |
Student > Doctoral Student | 1 | 10% |
Professor | 1 | 10% |
Student > Bachelor | 1 | 10% |
Student > Master | 1 | 10% |
Other | 1 | 10% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 80% |
Mathematics | 1 | 10% |
Unknown | 1 | 10% |