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 |
Calculating Graph Algorithms for Dominance and Shortest Path
|
|---|---|
| Chapter number | 8 |
| Book title |
Mathematics of Program Construction
|
| Published by |
Springer, Berlin, Heidelberg, June 2012
|
| DOI | 10.1007/978-3-642-31113-0_8 |
| Book ISBNs |
978-3-64-231112-3, 978-3-64-231113-0
|
| Authors |
Ilya Sergey, Jan Midtgaard, Dave Clarke, Sergey, Ilya, Midtgaard, Jan, Clarke, Dave |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 6 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 2 | 33% |
| Professor | 1 | 17% |
| Student > Doctoral Student | 1 | 17% |
| Student > Master | 1 | 17% |
| Professor > Associate Professor | 1 | 17% |
| Other | 0 | 0% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 4 | 67% |
| Mathematics | 1 | 17% |
| Engineering | 1 | 17% |