Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width

Horváth et al. "Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40988-2_40

[Horváth et al. "Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/horvath2013ecmlpkdd-efficient/) doi:10.1007/978-3-642-40988-2_40

@inproceedings{horvath2013ecmlpkdd-efficient,
  title     = {{Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width}},
  author    = {Horváth, Tamás and Otaki, Keisuke and Ramon, Jan},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2013},
  pages     = {622-637},
  doi       = {10.1007/978-3-642-40988-2_40},
  url       = {https://mlanthology.org/ecmlpkdd/2013/horvath2013ecmlpkdd-efficient/}
}