Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth

Horváth and Ramon. "Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. doi:10.1007/978-3-540-87479-9_52

[Horváth and Ramon. "Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.](https://mlanthology.org/ecmlpkdd/2008/horvath2008ecmlpkdd-efficient/) doi:10.1007/978-3-540-87479-9_52

@inproceedings{horvath2008ecmlpkdd-efficient,
  title     = {{Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth}},
  author    = {Horváth, Tamás and Ramon, Jan},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2008},
  pages     = {520-535},
  doi       = {10.1007/978-3-540-87479-9_52},
  url       = {https://mlanthology.org/ecmlpkdd/2008/horvath2008ecmlpkdd-efficient/}
}