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 |
The Complexity of Finding (Approximate Sized) Distance- d Dominating Set in Tournaments
|
---|---|
Chapter number | 3 |
Book title |
Frontiers in Algorithmics
|
Published by |
Springer, Cham, June 2017
|
DOI | 10.1007/978-3-319-59605-1_3 |
Book ISBNs |
978-3-31-959604-4, 978-3-31-959605-1
|
Authors |
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti, Biswas, Arindam, Jayapaul, Varunkumar, Raman, Venkatesh, Satti, Srinivasa Rao |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 50% |
Unknown | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Unknown | 2 | 100% |