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 |
NP-completeness Results for Partitioning a Graph into Total Dominating Sets
|
---|---|
Chapter number | 28 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Cham, August 2017
|
DOI | 10.1007/978-3-319-62389-4_28 |
Book ISBNs |
978-3-31-962388-7, 978-3-31-962389-4
|
Authors |
Mikko Koivisto, Petteri Laakkonen, Juho Lauri, Koivisto, Mikko, Laakkonen, Petteri, Lauri, Juho |
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 % |
---|---|---|
Researcher | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Unknown | 1 | 100% |