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 |
Parameterized Complexity of Min-Power Asymmetric Connectivity
|
---|---|
Chapter number | 8 |
Book title |
Combinatorial Algorithms
|
Published by |
Springer, Cham, July 2019
|
DOI | 10.1007/978-3-030-25005-8_8 |
Book ISBNs |
978-3-03-025004-1, 978-3-03-025005-8
|
Authors |
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein, Bentert, Matthias, Haag, Roman, Hofer, Christian, Koana, Tomohiro, Nichterlein, André |
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 % |
---|---|---|
Student > Ph. D. Student | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |