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.
Timeline
Mendeley readers
Chapter title |
Complexity and Approximation Results for the Connected Vertex Cover Problem
|
---|---|
Chapter number | 20 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2007
|
DOI | 10.1007/978-3-540-74839-7_20 |
Book ISBNs |
978-3-54-074838-0, 978-3-54-074839-7
|
Authors |
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Escoffier, Bruno, Gourvès, Laurent, Monnot, Jérôme |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 33% |
Researcher | 1 | 33% |
Lecturer | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |
Unknown | 1 | 33% |