Pascal Welke, Tamás Horváth, Stefan Wrobel. On the Complexity of Frequent Subtree Mining in Very Simple Structures. In Jesse Davis, Jan Ramon, editors, Inductive Logic Programming - 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers. Volume 9046 of Lecture Notes in Computer Science, pages 194-209, Springer, 2014. [doi]
@inproceedings{WelkeHW14,
title = {On the Complexity of Frequent Subtree Mining in Very Simple Structures},
author = {Pascal Welke and Tamás Horváth and Stefan Wrobel},
year = {2014},
doi = {10.1007/978-3-319-23708-4_14},
url = {http://dx.doi.org/10.1007/978-3-319-23708-4_14},
researchr = {https://researchr.org/publication/WelkeHW14},
cites = {0},
citedby = {0},
pages = {194-209},
booktitle = {Inductive Logic Programming - 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers},
editor = {Jesse Davis and Jan Ramon},
volume = {9046},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-23707-7},
}