%0 Conference Paper %1 conf/pkdd/AlonsoMCT08 %A Alonso, Andrés Gago %A Medina-Pagola, José Eladio %A Carrasco-Ochoa, Jesús Ariel %A Trinidad, José Francisco Martínez %B ECML/PKDD (1) %D 2008 %E Daelemans, Walter %E Goethals, Bart %E Morik, Katharina %I Springer %K dblp %P 365-376 %T Mining Frequent Connected Subgraphs Reducing the Number of Candidates. %U http://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#AlonsoMCT08 %V 5211 %@ 978-3-540-87478-2

@inproceedings{conf/pkdd/AlonsoMCT08, added-at = {2019-10-19T00:00:00.000+0200}, author = {Alonso, Andrés Gago and Medina-Pagola, José Eladio and Carrasco-Ochoa, Jesús Ariel and Trinidad, José Francisco Martínez}, biburl = {https://www.bibsonomy.org/bibtex/2a0995549ab5238c1f4b398fbef231c03/dblp}, 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_42}, interhash = {139a8c21797ba04ea04b037aa36f5570}, intrahash = {a0995549ab5238c1f4b398fbef231c03}, isbn = {978-3-540-87478-2}, keywords = {dblp}, pages = {365-376}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T09:49:36.000+0200}, title = {Mining Frequent Connected Subgraphs Reducing the Number of Candidates.}, url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#AlonsoMCT08}, volume = 5211, year = 2008 }