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 |
Generating All Patterns of Graph Partitions Within a Disparity Bound
|
---|---|
Chapter number | 10 |
Book title |
WALCOM: Algorithms and Computation
|
Published by |
Springer, Cham, March 2017
|
DOI | 10.1007/978-3-319-53925-6_10 |
Book ISBNs |
978-3-31-953924-9, 978-3-31-953925-6
|
Authors |
Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato, Kawahara, Jun, Horiyama, Takashi, Hotta, Keisuke, Minato, Shin-ichi |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Bachelor | 1 | 50% |
Student > Master | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 100% |