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 |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
|
---|---|
Chapter number | 23 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2006
|
DOI | 10.1007/11786986_23 |
Book ISBNs |
978-3-54-035904-3, 978-3-54-035905-0
|
Authors |
Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
Mendeley readers
The data shown below were compiled from readership statistics for 27 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
India | 1 | 4% |
Germany | 1 | 4% |
Unknown | 25 | 93% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 22% |
Student > Master | 5 | 19% |
Lecturer | 4 | 15% |
Professor > Associate Professor | 3 | 11% |
Researcher | 3 | 11% |
Other | 4 | 15% |
Unknown | 2 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 20 | 74% |
Mathematics | 2 | 7% |
Agricultural and Biological Sciences | 1 | 4% |
Physics and Astronomy | 1 | 4% |
Engineering | 1 | 4% |
Other | 0 | 0% |
Unknown | 2 | 7% |