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 |
Finding and counting small induced subgraphs efficiently
|
---|---|
Chapter number | 62 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1995
|
DOI | 10.1007/3-540-60618-1_62 |
Book ISBNs |
978-3-54-060618-5, 978-3-54-048487-5
|
Authors |
T. Kloks, D. Kratsch, H. Müller, Kloks, T., Kratsch, D., Müller, H. |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 3 | 30% |
Student > Ph. D. Student | 2 | 20% |
Other | 1 | 10% |
Lecturer | 1 | 10% |
Professor | 1 | 10% |
Other | 2 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 80% |
Mathematics | 1 | 10% |
Agricultural and Biological Sciences | 1 | 10% |