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 |
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
|
---|---|
Chapter number | 40 |
Book title |
Machine Learning and Knowledge Discovery in Databases
|
Published by |
Springer, Berlin, Heidelberg, September 2013
|
DOI | 10.1007/978-3-642-40988-2_40 |
Book ISBNs |
978-3-64-240987-5, 978-3-64-240988-2
|
Authors |
Tamás Horváth, Keisuke Otaki, Jan Ramon |
Mendeley readers
The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 8% |
Turkey | 1 | 8% |
Unknown | 11 | 85% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 46% |
Student > Master | 3 | 23% |
Other | 1 | 8% |
Researcher | 1 | 8% |
Unknown | 2 | 15% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 10 | 77% |
Arts and Humanities | 1 | 8% |
Unknown | 2 | 15% |