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 |
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs
|
---|---|
Chapter number | 35 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 1998
|
DOI | 10.1007/3-540-68535-9_35 |
Book ISBNs |
978-3-54-064824-6, 978-3-54-068535-7
|
Authors |
H. S. Chao, F. R. Hsu, R. C. T. Lee, Chao, H. S., Hsu, F. R., Lee, R. C. T. |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Argentina | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 25% |
Student > Bachelor | 1 | 25% |
Lecturer | 1 | 25% |
Student > Master | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 25% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |
Engineering | 1 | 25% |