@inproceedings{DBLP:conf/pkdd/HorvathR08,
author = {Tam{\'a}s Horv{\'a}th and
Jan Ramon},
title = {Efficient Frequent Connected Subgraph Mining in Graphs of
Bounded Treewidth},
booktitle = {ECML/PKDD (1)},
year = {2008},
pages = {520-535},
ee = {http://dx.doi.org/10.1007/978-3-540-87479-9_52},
crossref = {DBLP:conf/pkdd/2008-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/pkdd/2008-1,
editor = {Walter Daelemans and
Bart Goethals and
Katharina Morik},
title = {Machine Learning and Knowledge Discovery in Databases, European
Conference, ECML/PKDD 2008, Antwerp, Belgium, September
15-19, 2008, Proceedings, Part I},
booktitle = {ECML/PKDD (1)},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5211},
year = {2008},
isbn = {978-3-540-87478-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}