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 |
Fast Computation of the Tree Edit Distance between Unordered Trees Using IP Solvers
|
---|---|
Chapter number | 14 |
Book title |
Discovery Science
|
Published in |
Lecture notes in computer science, January 2014
|
DOI | 10.1007/978-3-319-11812-3_14 |
Book ISBNs |
978-3-31-911811-6, 978-3-31-911812-3
|
Authors |
Seiichi Kondo, Keisuke Otaki, Madori Ikeda, Akihiro Yamamoto |
Editors |
Sašo Džeroski, Panče Panov, Dragi Kocev, Ljupčo Todorovski |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 1 | 33% |
Other | 1 | 33% |
Student > Master | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Engineering | 1 | 33% |