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 |
Greedy Edge-Disjoint Paths in Complete Graphs
|
---|---|
Chapter number | 13 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2003
|
DOI | 10.1007/978-3-540-39890-5_13 |
Book ISBNs |
978-3-54-020452-7, 978-3-54-039890-5
|
Authors |
Paz Carmi, Thomas Erlebach, Yoshio Okamoto, Carmi, Paz, Erlebach, Thomas, Okamoto, Yoshio |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 50% |
Student > Ph. D. Student | 1 | 25% |
Lecturer | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 50% |
Mathematics | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |