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 |
The complexity of finding certain trees in tournaments
|
---|---|
Chapter number | 243 |
Book title |
Algorithms and Data Structures
|
Published by |
Springer, Berlin, Heidelberg, August 1993
|
DOI | 10.1007/3-540-57155-8_243 |
Book ISBNs |
978-3-54-057155-1, 978-3-54-047918-5
|
Authors |
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
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 % |
---|---|---|
Professor | 1 | 50% |
Unknown | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Unknown | 2 | 100% |