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 |
Approximating Longest Directed Paths and Cycles
|
---|---|
Chapter number | 21 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, January 2004
|
DOI | 10.1007/978-3-540-27836-8_21 |
Book ISBNs |
978-3-54-022849-3, 978-3-54-027836-8
|
Authors |
Andreas Björklund, Thore Husfeldt, Sanjeev Khanna |
Editors |
Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella |
Mendeley readers
The data shown below were compiled from readership statistics for 31 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 3% |
Hungary | 1 | 3% |
Canada | 1 | 3% |
Unknown | 28 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 10 | 32% |
Student > Master | 4 | 13% |
Researcher | 4 | 13% |
Student > Bachelor | 3 | 10% |
Professor > Associate Professor | 3 | 10% |
Other | 5 | 16% |
Unknown | 2 | 6% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 22 | 71% |
Engineering | 2 | 6% |
Agricultural and Biological Sciences | 2 | 6% |
Unspecified | 1 | 3% |
Physics and Astronomy | 1 | 3% |
Other | 1 | 3% |
Unknown | 2 | 6% |