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 |
An Õ(m 2 n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
|
---|---|
Chapter number | 23 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2005
|
DOI | 10.1007/11523468_23 |
Book ISBNs |
978-3-54-027580-0, 978-3-54-031691-6
|
Authors |
Telikepalli Kavitha |
Mendeley readers
The data shown below were compiled from readership statistics for 23 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
India | 1 | 4% |
Russia | 1 | 4% |
Unknown | 21 | 91% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 26% |
Student > Master | 4 | 17% |
Professor > Associate Professor | 3 | 13% |
Researcher | 3 | 13% |
Professor | 2 | 9% |
Other | 3 | 13% |
Unknown | 2 | 9% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 17 | 74% |
Mathematics | 2 | 9% |
Agricultural and Biological Sciences | 1 | 4% |
Physics and Astronomy | 1 | 4% |
Unknown | 2 | 9% |