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 |
Some Problems on Approximate Counting in Graphs and Matroids
|
|---|---|
| Chapter number | 23 |
| Book title |
Research Trends in Combinatorial Optimization
|
| Published by |
Springer, Berlin, Heidelberg, January 2009
|
| DOI | 10.1007/978-3-540-76796-1_23 |
| Book ISBNs |
978-3-54-076795-4, 978-3-54-076796-1
|
| Authors |
Dominic Welsh, Welsh, Dominic |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Switzerland | 1 | 20% |
| Unknown | 4 | 80% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor > Associate Professor | 2 | 40% |
| Researcher | 2 | 40% |
| Student > Master | 1 | 20% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 3 | 60% |
| Mathematics | 1 | 20% |
| Engineering | 1 | 20% |