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 |
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
|
---|---|
Chapter number | 37 |
Book title |
Algorithms and Computation
|
Published by |
Springer International Publishing, January 2014
|
DOI | 10.1007/978-3-319-13075-0_37 |
Book ISBNs |
978-3-31-913074-3, 978-3-31-913075-0
|
Authors |
Xingfu Li, Daming Zhu |
Editors |
Hee-Kap Ahn, Chan-Su Shin |
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 % |
---|---|---|
Unknown | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Biochemistry, Genetics and Molecular Biology | 1 | 100% |