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 |
The Computational Complexity of the Minimum Weight Processor Assignment Problem
|
---|---|
Chapter number | 16 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2004
|
DOI | 10.1007/978-3-540-30559-0_16 |
Book ISBNs |
978-3-54-024132-4, 978-3-54-030559-0
|
Authors |
Hajo J. Broersma, Daniel Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 7 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Other | 1 | 14% |
Student > Doctoral Student | 1 | 14% |
Professor | 1 | 14% |
Student > Master | 1 | 14% |
Researcher | 1 | 14% |
Other | 1 | 14% |
Unknown | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 71% |
Engineering | 1 | 14% |
Unknown | 1 | 14% |