%0 Conference Paper %1 conf/pkdd/HorvathR08 %A Horváth, Tamás %A Ramon, Jan %B ECML/PKDD (1) %D 2008 %E Daelemans, Walter %E Goethals, Bart %E Morik, Katharina %I Springer %K %P 520-535 %T Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. %U http://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#HorvathR08 %V 5211 %@ 978-3-540-87478-2

@inproceedings{conf/pkdd/HorvathR08, added-at = {2023-12-13T02:25:27.000+0100}, author = {Horváth, Tamás and Ramon, Jan}, biburl = {https://www.bibsonomy.org/bibtex/2983eb51b60c32019125c21b2c36f6efa/admin}, booktitle = {ECML/PKDD (1)}, crossref = {conf/pkdd/2008-1}, editor = {Daelemans, Walter and Goethals, Bart and Morik, Katharina}, ee = {https://doi.org/10.1007/978-3-540-87479-9_52}, interhash = {7f0909ea800fa4a4a6ffeb1fee199418}, intrahash = {983eb51b60c32019125c21b2c36f6efa}, isbn = {978-3-540-87478-2}, keywords = {}, pages = {520-535}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T02:25:27.000+0100}, title = {Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.}, url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#HorvathR08}, volume = 5211, year = 2008 }