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 |
Computing disjoint paths with length constraints
|
---|---|
Chapter number | 30 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1996
|
DOI | 10.1007/3-540-62559-3_30 |
Book ISBNs |
978-3-54-062559-9, 978-3-54-068072-7
|
Authors |
Spyros Tragoudas, Yaakov L. Varol |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 100% |