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 |
Approximating Minimum Dominating Set on String Graphs
|
---|---|
Chapter number | 18 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Cham, June 2019
|
DOI | 10.1007/978-3-030-30786-8_18 |
Book ISBNs |
978-3-03-030785-1, 978-3-03-030786-8
|
Authors |
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Chakraborty, Dibyayan, Das, Sandip, Mukherjee, Joydeep |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 100% |