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 |
Exact (Exponential) Algorithms for the Dominating Set Problem
|
---|---|
Chapter number | 21 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2004
|
DOI | 10.1007/978-3-540-30559-0_21 |
Book ISBNs |
978-3-54-024132-4, 978-3-54-030559-0
|
Authors |
Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
Mendeley readers
The data shown below were compiled from readership statistics for 20 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 5% |
Brazil | 1 | 5% |
Unknown | 18 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 15% |
Lecturer | 2 | 10% |
Professor | 2 | 10% |
Professor > Associate Professor | 2 | 10% |
Student > Master | 2 | 10% |
Other | 5 | 25% |
Unknown | 4 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 12 | 60% |
Mathematics | 2 | 10% |
Agricultural and Biological Sciences | 1 | 5% |
Unknown | 5 | 25% |