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 |
Extending the Tractability Border for Closest Leaf Powers
|
---|---|
Chapter number | 35 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2005
|
DOI | 10.1007/11604686_35 |
Book ISBNs |
978-3-54-031000-6, 978-3-54-031468-4
|
Authors |
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf |
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 % |
---|---|---|
Israel | 1 | 10% |
Unknown | 9 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 40% |
Researcher | 3 | 30% |
Student > Doctoral Student | 1 | 10% |
Lecturer | 1 | 10% |
Professor > Associate Professor | 1 | 10% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 70% |
Agricultural and Biological Sciences | 2 | 20% |
Mathematics | 1 | 10% |