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 |
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks
|
---|---|
Chapter number | 11 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, July 2010
|
DOI | 10.1007/978-3-642-14031-0_11 |
Book ISBNs |
978-3-64-214030-3, 978-3-64-214031-0
|
Authors |
Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil, Kamei, Sayaka, Kakugawa, Hirotsugu, Devismes, Stéphane, Tixeuil, Sébastien |
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 > Master | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Engineering | 1 | 100% |